Ebook: Graph-Theoretic Concepts in Computer Science: 28th International Workshop, WG 2002 Český Krumlov, Czech Republic, June 13–15, 2002 Revised Papers

The 28th International Workshop on Graph-Theoretic Concepts in Computer ? Science (WG 2002) was held in Cesky ´ Krumlov, a beautiful small town in the southern part of the Czech Republic on the river Vltava (Moldau), June 13–15, 2002. The workshop was organized by the Department of Applied Mathematics of the Faculty of Mathematics and Physics of Charles University in Prague. Since 1975, WG has taken place in Germany 20 times, twice in Austria and The Netherlands, and once in Italy, Slovakia, and Switzerland. As in previous years, the workshop aimed at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in Computer Science, or by extracting new problems from applications.The workshop was devoted to the theoretical and practical aspects of graph concepts in computer science, and its contributed talks showed how recent research results from algorithmic graph theory can be used in computer science and which graph-theoretic questions arise from new developments in computer science. Altogether 61 research papers were submitted and reviewed by the program committee. The program committee represented the wide scienti?c spectrum, and in a careful reviewing process with four reports per submission it selected 36papersforpresentationattheworkshop.Thereferees’commentsaswellasthe numerous fruitful discussions during the workshop have been taken into account by the authors of these conference proceedings.

---

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.

---

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.

Content:
Front Matter....Pages I-XI
Maximum Cardinality Search for Computing Minimal Triangulations....Pages 1-12
DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem....Pages 13-24
On the Minimum Size of a Contraction-Universal Tree....Pages 25-34
Optimal Area Algorithm for Planar Polyline Drawings....Pages 35-46
Cycles in Generalized Networks....Pages 47-56
New Graph Classes of Bounded Clique-Width....Pages 57-67
More about Subcolorings....Pages 68-79
Search in Indecomposable Graphs....Pages 80-91
On the Complexity of (k, l)-Graph Sandwich Problems....Pages 92-101
Algorithms and Models for the On-Line Vertex-Covering....Pages 102-113
Weighted Node Coloring: When Stable Sets Are Expensive....Pages 114-125
The Complexity of Restrictive H-Coloring....Pages 126-137
A New 3-Color Criterion for Planar Graphs....Pages 138-149
An Additive Stretched Routing Scheme for Chordal Graphs....Pages 150-163
Complexity of Pattern Coloring of Cycle Systems....Pages 164-175
Safe Reduction Rules for Weighted Treewidth....Pages 176-185
Graph Separator Algorithms: A Refined Analysis....Pages 186-197
Generalized H-Coloring and H-Covering of Trees....Pages 198-210
The Complexity of Approximating the Oriented Diameter of Chordal Graphs....Pages 211-222
Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies....Pages 223-234
Completely Independent Spanning Trees in Maximal Planar Graphs....Pages 235-245
Facets of the Directed Acyclic Graph Layering Polytope....Pages 246-257
Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP....Pages 258-269
Complexity of Some Infinite Games Played on Finite Graphs....Pages 270-281
New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs....Pages 282-295
A Multi-scale Algorithm for the Linear Arrangement Problem....Pages 296-309
On the b-Chromatic Number of Graphs....Pages 310-320
Budgeted Maximum Graph Coverage....Pages 321-332
Online Call Admission in Optical Networks with Larger Demands....Pages 333-344
The Forest Wrapping Problem on Outerplanar Graphs....Pages 345-354
Bend-Minimum Orthogonal Drawings of Plane 3-Graphs....Pages 355-366
Cluster Graph Modification Problems....Pages 367-378
Two Counterexamples in Graph Drawing....Pages 379-390
Connected and Loosely Connected List Homomorphisms....Pages 391-398
Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal....Pages 399-412
Back Matter....Pages 413-420
....Pages 421-422