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.

Buying options

eBook USD 89.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-46784-7
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 119.00
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

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

Keywords

  • Graph
  • Graph computations
  • Matching
  • Matchings
  • Partition
  • Permutation
  • algorithms
  • approximation
  • combinatorial optimization
  • complexity
  • computational geometry
  • garph drawing
  • geometry algorithms
  • graph algorithms
  • graph coloring
  • algorithm analysis and problem complexity
  • combinatorics
  • data structures

Editors and Affiliations

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

    Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz

Bibliographic Information

  • Book Title: Graph-Theoretic Concepts in Computer Science

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

  • Editors: Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-46784-X

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1999

  • Softcover ISBN: 978-3-540-66731-5Published: 27 October 1999

  • eBook ISBN: 978-3-540-46784-7Published: 26 June 2003

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XI, 416

  • Topics: Theory of Computation, Algorithms, Discrete Mathematics, Data Science, Computer Graphics

Buying options

eBook USD 89.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-46784-7
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 119.00
Price excludes VAT (USA)