Graph-theoretic concepts in computer science : 27th international workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001 ; proceedings /
Saved in:
| Meeting name: | International Workshop WG (27th : 2001 : Boltenhagen, Germany) |
|---|---|
| Imprint: | Berlin : Springer, 2001. |
| Description: | x, 327 pages : illustrations ; 24 cm. |
| Language: | English |
| Series: | Lecture notes in computer science, 0302-9743 ; 2204 |
| Subject: | |
| Format: | E-Resource Print Book |
| URL for this record: | http://pi.lib.uchicago.edu/1001/cat/bib/4516052 |
Table of Contents:
- Invited Presentation: Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces
- Invited Presentation: 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,+)-Distance-Hereditary 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 Coloringof 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-DominatingSets in Planar Graphs with Applications
- Lower Bounds for Approximation Algorithms for the Steiner Tree Problem
- log n-Approximative NLC k -Decomposition in O(n 2k+1 ) Time
- On Subfamilies of AT-Free Graphs
- Complexity of ColoringGraphs without Forbidden Induced Subgraphs
- On Stable Cutsets in Line Graphs
- On StrongMenger-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
- Author Index
