[go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Graph-Theoretic Concepts in Computer Science

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

  • Conference proceedings
  • © 2001

Overview

Editors:
  1. Andreas Brandstädt

    1. Department of Computer Science, University of Rostock, Rostock, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Van Bang Le

    1. Department of Computer Science, University of Rostock, Rostock, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Included in the following conference series:

Conference proceedings info: WG 2001.

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

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Licence this eBook for your library

Institutional subscriptions

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.

Similar content being viewed by others

Keywords

Table of contents (29 papers)

  1. Front Matter

    Pages I-X
    Download chapter PDF

  2. Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces

    • Hans-J. Bandelt
    Pages 1-7

  3. Data Management in Networks

    • Friedhelm Meyer auf der Heide
    Pages 8-8

  4. Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs

    • Sergei L. Bezrukov, Robert Elsässer
    Pages 9-20

  5. Approximate Constrained Bipartite Edge Coloring

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

  6. Maximum Clique Transversals

    • Maw-Shang Chang, Ton Kloks, Chuan-Min Lee
    Pages 32-43

  7. On the Tree-Degree of Graphs

    • Maw-Shang Chang, Haiko Müller
    Pages 44-54

  8. On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms

    • Jianer Chen, Iyad A. Kanj
    Pages 55-65

  9. (k+) -Disatance- Herediatry Graphs

    • Serafino Cicerone, Gianluca D’Ermiliis, Gabriele Di Stefano
    Pages 66-77

  10. On the Relationship between Clique-Width and Treewidth

    • Derek G. Corneil, Udi Rotics
    Pages 78-90

  11. Planarity of the 2-Level Cactus Model

    • Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner
    Pages 91-102

  12. Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach

    • Feodor F. Dragan
    Pages 103-116

  13. How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time

    • Wolfgang Espelage, Frank Gurski, Egon Wanke
    Pages 117-128

  14. (g, f)-Factorizations Orthogonal to k Subgraphs

    • Haodi Feng
    Pages 129-139

  15. On Star Coloring of Graphs

    • Guillaume Fertin, André Raspaud, Bruce Reed
    Pages 140-153

  16. Graph Subcolorings: Complexity and Algorithms

    • Jiří Fiala, Klaus Jansen, Van Bang Le, Eike Seidel
    Pages 154-165

  17. Approximation of Pathwidth of Outerplanar Graphs

    • Fedor V. Fomin, Hans L. Bodlaender
    Pages 166-176

  18. On the Monotonicity of Games Generated by Symmetric Submodular Functions

    • Fedor V. Fomin, Dimitrios M. Thilikos
    Pages 177-188

  19. Multiple Hotlink Assignment

    • Sven Fuhrmann, Sven Oliver Krumke, Hans-Christoph Wirth
    Pages 189-200

  20. Small k-Dominating Sets in Planar Graphs with Applications

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

Other volumes

  1. Graph-Theoretic Concepts in Computer Science

Editors and Affiliations

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

    Andreas Brandstädt, Van Bang Le

Bibliographic Information

Publish with us

Policies and ethics

Back to top