Table of contents

  1. Front Matter
  2. Hans L. Bodlaender, John R. Gilbert, Hjálmtýr Hafsteinsson, Ton Kloks
    Pages 1-12
  3. R. Heckmann, R. Klasing, B. Monien, W. Unger
    Pages 25-35
  4. Albert Zündorf, Andy Schürr
    Pages 48-62
  5. Marc Andries, Jan Paredaens
    Pages 63-74
  6. Rudolf Freund, Brigitte Haberstroh
    Pages 75-84
  7. J. Czyzowicz, E. Rivera-Campo, N. Santoro, J. Urrutia, J. Zaks
    Pages 105-112
  8. Leonidas J. Guibas, Joseph S. B. Mitchell, Thomas Roos
    Pages 113-125
  9. Takayoshi Shoudai, Satoru Miyano
    Pages 126-134
  10. Zvi M. Kedem, Krishna V. Palem, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
    Pages 135-147
  11. Ondrej Sýkora, Imrich Vrto
    Pages 159-168
  12. Esteban Feuerstein, Alberto Marchetti-Spaccamela
    Pages 187-197
  13. Peter Damaschke
    Pages 219-225
  14. Hans L. Bodlaender
    Pages 230-238
  15. Andreas Brandstädt
    Pages 239-249
  16. Back Matter

About these proceedings


This volume contains contributions to the 17th International workshop on Graph-Theoretic Concepts in Computer Science (WG '91) held in Southern Bavaria in June 1991. These annual workshops are designed to bring together researchers using graph-theoretic methods to discuss new developments relating to or emerging from a diversity of application fields. The topics covered in this volume include: tree-related problems, graph grammarsand rewriting, complexity, computational geometry, parallel algorithms, vertex orderings, path-oriented algorithms, applications to VLSI, and disjoint cycle problems.


Graph VLSI Vertex algorithm algorithms complexity computational geometry computer computer science

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1992
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-55121-8
  • Online ISBN 978-3-540-46735-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site