Graph-theoretic concepts in computer science : 27th international workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001 : proceedings
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...
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | , |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
2204 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Graph-theoretic concepts in computer science, 27th international workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, proceedings, Andreas Brandstädt, Van Bang Le (eds.), Berlin, Springer, 2001, 1 vol. (X-327 p.), Lecture notes in computer science, 3-540-42707-4 • Graph-Theoretic Concepts in Computer Science, Texte imprimé, 9783662184493 |
Table des matières:
- 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.