The Resource Graph-theoretic concepts in computer science : 28th international workshop, WG 2002, Český Krumlov, Czech Republic, June 13-15, 2002 ; revised papers, Luděk Kučera (ed.)
Graph-theoretic concepts in computer science : 28th international workshop, WG 2002, Český Krumlov, Czech Republic, June 13-15, 2002 ; revised papers, Luděk Kučera (ed.)
Resource Information
The item Graph-theoretic concepts in computer science : 28th international workshop, WG 2002, Český Krumlov, Czech Republic, June 13-15, 2002 ; revised papers, Luděk Kučera (ed.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item Graph-theoretic concepts in computer science : 28th international workshop, WG 2002, Český Krumlov, Czech Republic, June 13-15, 2002 ; revised papers, Luděk Kučera (ed.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 1 library branch.
- Summary
- This book constitutes the refereed proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2002, held in Cesky Krumlov, Czech Republic in June 2002. The 36 revised full papers presented were carefully selected from initially 61 submissions during two rounds of reviewing and improvement. The papers provide a wealth of new results for various classes of graphs, graph computations, graph algorithms, and graph-theoretical applications in various fields
- Language
- eng
- Extent
- 1 online resource (xi, 422 pages)
- Contents
-
- Maximum Cardinality Search for Computing Minimal Triangulations
- DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem
- On the Minimum Size of a Contraction-Universal Tree
- Optimal Area Algorithm for Planar Polyline Drawings
- Cycles in Generalized Networks
- New Graph Classes of Bounded Clique-Width
- More about Subcolorings
- Search in Indecomposable Graphs
- On the Complexity of (k, l)-Graph Sandwich Problems
- Algorithms and Models for the On-Line Vertex-Covering
- Weighted Node Coloring: When Stable Sets Are Expensive
- The Complexity of Restrictive H-Coloring
- A New 3-Color Criterion for Planar Graphs
- An Additive Stretched Routing Scheme for Chordal Graphs
- Complexity of Pattern Coloring of Cycle Systems
- Safe Reduction Rules for Weighted Treewidth
- Graph Separator Algorithms: A Refined Analysis
- Generalized H-Coloring and H-Covering of Trees
- The Complexity of Approximating the Oriented Diameter of Chordal Graphs
- Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies
- Completely Independent Spanning Trees in Maximal Planar Graphs
- Facets of the Directed Acyclic Graph Layering Polytope
- Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP
- Complexity of Some Infinite Games Played on Finite Graphs
- New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs
- A Multi-scale Algorithm for the Linear Arrangement Problem
- On the b-Chromatic Number of Graphs
- Budgeted Maximum Graph Coverage
- Online Call Admission in Optical Networks with Larger Demands
- The Forest Wrapping Problem on Outerplanar Graphs
- On the Recognition of P 4 -Comparability Graphs
- Bend-Minimum Orthogonal Drawings of Plane 3-Graphs
- Cluster Graph Modification Problems
- Two Counterexamples in Graph Drawing
- Connected and Loosely Connected List Homomorphisms
- Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal
- Isbn
- 9783540363798
- Label
- Graph-theoretic concepts in computer science : 28th international workshop, WG 2002, Český Krumlov, Czech Republic, June 13-15, 2002 ; revised papers
- Title
- Graph-theoretic concepts in computer science
- Title remainder
- 28th international workshop, WG 2002, Český Krumlov, Czech Republic, June 13-15, 2002 ; revised papers
- Statement of responsibility
- Luděk Kučera (ed.)
- Title variation
- WG 2002
- Language
- eng
- Summary
- This book constitutes the refereed proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2002, held in Cesky Krumlov, Czech Republic in June 2002. The 36 revised full papers presented were carefully selected from initially 61 submissions during two rounds of reviewing and improvement. The papers provide a wealth of new results for various classes of graphs, graph computations, graph algorithms, and graph-theoretical applications in various fields
- Cataloging source
- SCPER
- Dewey number
- 004.015115
- Illustrations
- illustrations
- Index
- index present
- LC call number
- QA166
- LC item number
- .G7172 2002
- Literary form
- non fiction
- http://bibfra.me/vocab/lite/meetingDate
- 2002
- http://bibfra.me/vocab/lite/meetingName
- International Workshop WG
- Nature of contents
-
- dictionaries
- bibliography
- http://library.link/vocab/relatedWorkOrContributorName
- Kučera, Luděk
- Series statement
- Lecture notes in computer science,
- Series volume
- 2573
- http://library.link/vocab/subjectName
-
- Computer science
- Graph theory
- Graph theory
- Computer science
- Graph theory
- Graph theory
- Label
- Graph-theoretic concepts in computer science : 28th international workshop, WG 2002, Český Krumlov, Czech Republic, June 13-15, 2002 ; revised papers, Luděk Kučera (ed.)
- Bibliography note
- Includes bibliographical references and index
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- Maximum Cardinality Search for Computing Minimal Triangulations -- DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem -- On the Minimum Size of a Contraction-Universal Tree -- Optimal Area Algorithm for Planar Polyline Drawings -- Cycles in Generalized Networks -- New Graph Classes of Bounded Clique-Width -- More about Subcolorings -- Search in Indecomposable Graphs -- On the Complexity of (k, l)-Graph Sandwich Problems -- Algorithms and Models for the On-Line Vertex-Covering -- Weighted Node Coloring: When Stable Sets Are Expensive -- The Complexity of Restrictive H-Coloring -- A New 3-Color Criterion for Planar Graphs -- An Additive Stretched Routing Scheme for Chordal Graphs -- Complexity of Pattern Coloring of Cycle Systems -- Safe Reduction Rules for Weighted Treewidth -- Graph Separator Algorithms: A Refined Analysis -- Generalized H-Coloring and H-Covering of Trees -- The Complexity of Approximating the Oriented Diameter of Chordal Graphs -- Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies -- Completely Independent Spanning Trees in Maximal Planar Graphs -- Facets of the Directed Acyclic Graph Layering Polytope -- Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP -- Complexity of Some Infinite Games Played on Finite Graphs -- New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs -- A Multi-scale Algorithm for the Linear Arrangement Problem -- On the b-Chromatic Number of Graphs -- Budgeted Maximum Graph Coverage -- Online Call Admission in Optical Networks with Larger Demands -- The Forest Wrapping Problem on Outerplanar Graphs -- On the Recognition of P 4 -Comparability Graphs -- Bend-Minimum Orthogonal Drawings of Plane 3-Graphs -- Cluster Graph Modification Problems -- Two Counterexamples in Graph Drawing -- Connected and Loosely Connected List Homomorphisms -- Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal
- Control code
- 325544348
- Dimensions
- unknown
- Extent
- 1 online resource (xi, 422 pages)
- Form of item
- online
- Isbn
- 9783540363798
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other control number
- 10.1007/3-540-36379-3
- Other physical details
- illustrations.
- Sound
- unknown sound
- Specific material designation
- remote
- System control number
- (OCoLC)325544348
- Label
- Graph-theoretic concepts in computer science : 28th international workshop, WG 2002, Český Krumlov, Czech Republic, June 13-15, 2002 ; revised papers, Luděk Kučera (ed.)
- Bibliography note
- Includes bibliographical references and index
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- Maximum Cardinality Search for Computing Minimal Triangulations -- DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem -- On the Minimum Size of a Contraction-Universal Tree -- Optimal Area Algorithm for Planar Polyline Drawings -- Cycles in Generalized Networks -- New Graph Classes of Bounded Clique-Width -- More about Subcolorings -- Search in Indecomposable Graphs -- On the Complexity of (k, l)-Graph Sandwich Problems -- Algorithms and Models for the On-Line Vertex-Covering -- Weighted Node Coloring: When Stable Sets Are Expensive -- The Complexity of Restrictive H-Coloring -- A New 3-Color Criterion for Planar Graphs -- An Additive Stretched Routing Scheme for Chordal Graphs -- Complexity of Pattern Coloring of Cycle Systems -- Safe Reduction Rules for Weighted Treewidth -- Graph Separator Algorithms: A Refined Analysis -- Generalized H-Coloring and H-Covering of Trees -- The Complexity of Approximating the Oriented Diameter of Chordal Graphs -- Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies -- Completely Independent Spanning Trees in Maximal Planar Graphs -- Facets of the Directed Acyclic Graph Layering Polytope -- Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP -- Complexity of Some Infinite Games Played on Finite Graphs -- New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs -- A Multi-scale Algorithm for the Linear Arrangement Problem -- On the b-Chromatic Number of Graphs -- Budgeted Maximum Graph Coverage -- Online Call Admission in Optical Networks with Larger Demands -- The Forest Wrapping Problem on Outerplanar Graphs -- On the Recognition of P 4 -Comparability Graphs -- Bend-Minimum Orthogonal Drawings of Plane 3-Graphs -- Cluster Graph Modification Problems -- Two Counterexamples in Graph Drawing -- Connected and Loosely Connected List Homomorphisms -- Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal
- Control code
- 325544348
- Dimensions
- unknown
- Extent
- 1 online resource (xi, 422 pages)
- Form of item
- online
- Isbn
- 9783540363798
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other control number
- 10.1007/3-540-36379-3
- Other physical details
- illustrations.
- Sound
- unknown sound
- Specific material designation
- remote
- System control number
- (OCoLC)325544348
Subject
- Computer science
- Computer science -- Congresses
- Conference papers and proceedings
- Conference papers and proceedings
- Graph theory
- Graph theory
- Graph theory -- Congresses
- Graph theory -- Data processing
- Graph theory -- Data processing
- Graph theory -- Data processing -- Congresses
- Computer science
Genre
Member of
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Graph-theoretic-concepts-in-computer-science-/Bn6RcMuQa-I/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Graph-theoretic-concepts-in-computer-science-/Bn6RcMuQa-I/">Graph-theoretic concepts in computer science : 28th international workshop, WG 2002, Český Krumlov, Czech Republic, June 13-15, 2002 ; revised papers, Luděk Kučera (ed.)</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item Graph-theoretic concepts in computer science : 28th international workshop, WG 2002, Český Krumlov, Czech Republic, June 13-15, 2002 ; revised papers, Luděk Kučera (ed.)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Graph-theoretic-concepts-in-computer-science-/Bn6RcMuQa-I/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Graph-theoretic-concepts-in-computer-science-/Bn6RcMuQa-I/">Graph-theoretic concepts in computer science : 28th international workshop, WG 2002, Český Krumlov, Czech Republic, June 13-15, 2002 ; revised papers, Luděk Kučera (ed.)</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
