Skip to main content
  • Conference proceedings
  • © 1999

Graph-Theoretic Concepts in Computer Science

25th International Workshop, WG'99, Ascona, Switzerland, June 17-19, 1999 Proceedings

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

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

Conference proceedings info: WG 1999.

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 (37 papers)

  1. Front Matter

    Pages I-XI
  2. Silver Graphs: Achievements and New Challenges

    • Hartmut Noltemeier
    Pages 1-9
  3. Euler Is Standing in Line

    • D. Hauptmeier, S. O. Krumke, J. Rambau, H.-C. Wirth
    Pages 42-54
  4. Complexity Classification of Some Edge Modification Problems

    • Assaf Natanzon, Ron Shamir, Roded Sharan
    Pages 65-77
  5. On Minimum Diameter Spanning Trees under Reload Costs

    • Hans-Christoph Wirth, Jan Steffan
    Pages 78-89
  6. Mod-2 Independence and Domination in Graphs

    • Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
    Pages 101-109
  7. NLC2-Decomposition in Polynomial Time

    • Öjvind Johansson
    Pages 110-121
  8. On the Nature of Structure and Its Identification

    • Benno Stein, Oliver Niggemann
    Pages 122-134
  9. On the Clique—Width of Perfect Graph Classes

    • Martin Charles Golumbic, Udi Rotics
    Pages 135-147
  10. An Improved Algorithm for Finding Tree Decompositions of Small Width

    • Ljubomir Perković, Bruce Reed
    Pages 148-154
  11. Generating All the Minimal Separators of a Graph

    • Anne Berry, Jean-Paul Bordat, Olivier Cogis
    Pages 167-172
  12. Two Broadcasting Problems in FaultyHypercubes

    • Stefan Dobrev, Imrich Vrťo
    Pages 173-178
  13. Routing Permutations in the Hypercube

    • Olivier Baudon, Guillaume Fertin, Ivan Havel
    Pages 179-190

Other Volumes

  1. Graph-Theoretic Concepts in Computer Science

Editors and Affiliations

  • Institute for Theoretical Computer Science ETH Zürich ETH Zentrum, Zürich, Switzerland

    Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz

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