Skip to main content
  • Conference proceedings
  • © 2001

Graph-Theoretic Concepts in Computer Science

27th International Workshop, WG 2001 Boltenhagen, Germany, June 14-16, 2001 Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2204)

Conference series link(s): WG: International Workshop on Graph-Theoretic Concepts in Computer Science

Conference proceedings info: WG 2001.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (29 papers)

  1. Front Matter

    Pages I-X
  2. Data Management in Networks

    • Friedhelm Meyer auf der Heide
    Pages 8-8
  3. Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs

    • Sergei L. Bezrukov, Robert Elsässer
    Pages 9-20
  4. Approximate Constrained Bipartite Edge Coloring

    • Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stéphane Pérennes, Pino Persiano, Hervé Rivano
    Pages 21-31
  5. Maximum Clique Transversals

    • Maw-Shang Chang, Ton Kloks, Chuan-Min Lee
    Pages 32-43
  6. On the Tree-Degree of Graphs

    • Maw-Shang Chang, Haiko Müller
    Pages 44-54
  7. (k+) -Disatance- Herediatry Graphs

    • Serafino Cicerone, Gianluca D’Ermiliis, Gabriele Di Stefano
    Pages 66-77
  8. On the Relationship between Clique-Width and Treewidth

    • Derek G. Corneil, Udi Rotics
    Pages 78-90
  9. Planarity of the 2-Level Cactus Model

    • Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner
    Pages 91-102
  10. How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time

    • Wolfgang Espelage, Frank Gurski, Egon Wanke
    Pages 117-128
  11. On Star Coloring of Graphs

    • Guillaume Fertin, André Raspaud, Bruce Reed
    Pages 140-153
  12. Graph Subcolorings: Complexity and Algorithms

    • Jiří Fiala, Klaus Jansen, Van Bang Le, Eike Seidel
    Pages 154-165
  13. Approximation of Pathwidth of Outerplanar Graphs

    • Fedor V. Fomin, Hans L. Bodlaender
    Pages 166-176
  14. On the Monotonicity of Games Generated by Symmetric Submodular Functions

    • Fedor V. Fomin, Dimitrios M. Thilikos
    Pages 177-188
  15. Multiple Hotlink Assignment

    • Sven Fuhrmann, Sven Oliver Krumke, Hans-Christoph Wirth
    Pages 189-200
  16. Small k-Dominating Sets in Planar Graphs with Applications

    • Cyril Gavoille, David Peleg, André Raspaud, Eric Sopena
    Pages 201-216

Other Volumes

  1. Graph-Theoretic Concepts in Computer Science

About this book

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.

Editors and Affiliations

  • Department of Computer Science, University of Rostock, Rostock, Germany

    Andreas Brandstädt, Van Bang Le

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access