Coverart for item
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.)

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
Creator
Contributor
Subject
Genre
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
Member of
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.)
Instantiates
Publication
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.)
Publication
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

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
Processing Feedback ...