Graph-Theoretic Concepts in Computer Science

27th International Workshop, WG 2001 Boltenhagen, Germany, June 14-16, 2001 Proceedings
2001
ISBN: 978-3-540-42707-0
Verlag: Springer Berlin Heidelberg

Buch, Englisch, Band 2204, 334 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1070 g

Reihe: Lecture Notes in Computer Science

This book constitutes the thoroughly refereed post-workshop proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001, held in Boltenhagen, Germany, in June 2001.
The 27 revised full papers presented together with two invited contributions were carefully reviewed and selected from numerous submissions. The papers provide a wealth of new results for various classes of graphs, graph computations, graph algorithms and graph-theoretical applications in various fields.

Zielgruppe

Research

Autoren/Hrsg.

Le, Van Bang

Brandstädt, Andreas

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
• Mathematik | Informatik Mathematik Operations Research Graphentheorie
• Mathematik | Informatik EDV | Informatik Daten / Datenbanken Zeichen- und Zahlendarstellungen
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Grafikprogrammierung

Inhaltsverzeichnis

Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces.- Data Management in Networks.- Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs.- Approximate Constrained Bipartite Edge Coloring.- Maximum Clique Transversals.- On the Tree-Degree of Graphs.- On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms.- (k+) -Disatance- Herediatry Graphs.- On the Relationship between Clique-Width and Treewidth.- Planarity of the 2-Level Cactus Model.- Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach.- How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time.- (g, f)-Factorizations Orthogonal to k Subgraphs.- On Star Coloring of Graphs.- Graph Subcolorings: Complexity and Algorithms.- Approximation of Pathwidth of Outerplanar Graphs.- On the Monotonicity of Games Generated by Symmetric Submodular Functions.- Multiple Hotlink Assignment.- Small k-Dominating Sets in Planar Graphs with Applications.- Lower Bounds for Algorithms for the Steiner Tree Problem.- log n-Approximative NLCk-Decomposition in O(n 2k+1) Time.- On Subfamilies of AT-Free Graphs.- Complexity of Coloring Graphs without Forbidden Induced Subgraphs.- On Stable Cutsets in Line Graphs.- On Strong Menger-Connectivity of Star Graphs.- The Complexity of the Matching-Cut Problem.- De Bruijn Graphs and DNA Graphs.- A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness.- Critical and Anticritical Edges in Perfect Graphs.