Graph-Theoretic Concepts in Computer Science

Graph-Theoretic Concepts in Computer Science: 27th InternationalWorkshop, WG 2001 Boltenhagen, Germany, June 14–16, 2001 ProceedingsAuthor: Andreas Brandstädt, Van Bang Le Published by Springer Berlin Heidelberg ISBN: 978-3-540-42707-0 DOI: 10.1007/3-540-45477-2Table of Contents: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