Table of contents

  1. Front Matter
  2. Seshu Madhavapeddy, I. Hal Sudborough
    Pages 3-18
  3. Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro
    Pages 19-33
  4. A. Das, K. Thulasiraman, V. K. Agarwal, K. B. Lakshmanan
    Pages 34-45
  5. Michel Billaud, Pierre Lafon, Yves Metivier, Eric Sopena
    Pages 94-106
  6. Annegret Habel, Hans-Jörg Kreowski
    Pages 107-120
  7. H. Bunke, B. Haller
    Pages 136-150
  8. Franz J. Brandenburg
    Pages 166-180
  9. Gabriele Reich, Peter Widmayer
    Pages 196-210
  10. Ewald Speckenmeyer
    Pages 218-231
  11. Andreas Henrich, Hans-Werner Six, Peter Widmayer
    Pages 260-276
  12. Antonio Lozano, José L. Balcázar
    Pages 277-286
  13. Richard Anderson, Simon Kahan, Martine Schlag
    Pages 287-301
  14. K. Menzel, B. Monien
    Pages 302-315
  15. Marc J. van Kreveld, Mark T. de Berg
    Pages 341-355
  16. Back Matter

About these proceedings


The aim of this workshop series is to contribute to integration in computer science by applying graph-theoretic concepts. Commonalities between various fields of specialization in computer science may be detected by applying graph-theoretic concepts. The workshops are unusual in that they combine theoretical aspects with practice and applications. Applications dealt with in this volume include the use of graph-theoretic concepts in distributed and parallel computation, VLSI, CAD, software engineering, computer graphics, data structures, and computational geometry.


Action Algorithms Digraph Graph Graph theory Sim VLSI algorithm complexity data structure data structures distributed systems modeling processor software engineering

Bibliographic information

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