Skip to main content
  • Conference proceedings
  • © 1997

Graph-Theoretic Concepts in Computer Science

23rd International Workshop, WG'97, Berlin, Germany, June 18-20, 1997. Proceedings


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

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

Conference proceedings info: WG 1997.

Buying options

Softcover Book USD 109.00
Price excludes VAT (USA)

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

Table of contents (29 papers)

  1. Front Matter

  2. On the number of simple cycles in planar graphs

    • Helmut Alt, Ulrich Fuchs, Klaus Kriegel
    Pages 15-24
  3. On the separable-homogeneous decomposition of graphs

    • Luitpold Babel, Stephan Olariu
    Pages 25-37
  4. Pseudo-hamiltonian graphs

    • Luitpold Babel, Gerhard J. Woeginger
    Pages 38-51
  5. Acyclic orientations for deadlock prevention in interconnection networks

    • Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes
    Pages 52-64
  6. Weak-order extensions of an order

    • Karell Bertet, Jens Gustedt, Michel Morvan
    Pages 65-77
  7. An upper bound for the maximum cut mean value

    • Alberto Bertoni, Paola Campadelli, Roberto Posenato
    Pages 78-84
  8. NP-completeness results for minimum planar spanners

    • Ulrik Brandes, Dagmar Handke
    Pages 85-99
  9. Algorithms for the treewidth and minimum fill-in of HHD-free graphs

    • H. J. Broersma, E. Dahlhaus, T. Kloks
    Pages 109-117
  10. Block decomposition of inheritance hierarchies

    • Christian Capelle
    Pages 118-131
  11. On-line algorithms for networks of temporal constraints

    • Fabrizio d'Amore, Fabio Iacobini
    Pages 144-156
  12. Parallel algorithms for treewidth two

    • Babette de Fluiter, Hans L. Bodlaender
    Pages 157-170
  13. On optimal graphs embedded into paths and rings, with analysis using l 1-spheres

    • Yefim Dinitz, Marcelo Feighelstein, Shmuel Zaks
    Pages 171-183
  14. Off-line and on-line call-scheduling in stars and trees

    • Thomas Erlebach, Klaus Jansen
    Pages 199-213
  15. Computational complexity of the Krausz dimension of graphs

    • Petr Hliněný, Jan Kratochvíl
    Pages 214-228

Other Volumes

  1. Graph-Theoretic Concepts in Computer Science

About this book

This book constitutes the strictly refereed post-workshop proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG'97, held in Berlin, Germany in June 1997.
The volume presents 28 revised full papers carefully selected for inclusion in the book from 42 submissions. The papers address a variety of graph-theoretic issues relevant from the computer science point of view such as graph algorithms, cycles, graph decompositions, interconnection networks, local search, graph orderings, graph matching, graph languages, tree-width computation, etc.


  • Algorithms
  • Graph
  • Matching
  • Sim
  • algorithm
  • complexity
  • computer
  • computer science
  • programming
  • sets
  • algorithm analysis and problem complexity
  • data structures
  • combinatorics

Bibliographic Information

Buying options

Softcover Book USD 109.00
Price excludes VAT (USA)