Skip to main content
  • Conference proceedings
  • © 1988

Graph-Theoretic Concepts in Computer Science

International Workshop WG '87, Kloster Banz/Staffelstein, FRG, June 29 - July 1, 1987. Proceedings

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

Buying options

Softcover Book USD 99.00
Price excludes VAT (USA)

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

Table of contents (19 papers)

  1. Front Matter

  2. Distributed parallelism of graph transformations

    • Hartmut Ehrig, Paul Boehm, Udo- Hummert, Michael Löwe
    Pages 1-19
  3. A PrT-net representation of graph grammars

    • Esa Montonen, Leo Ojala, Timo Tuuliniemi
    Pages 20-31
  4. Pretty patterns produced by hyperedge replacement

    • Annegret Habel, Hans-Jörg Kreowski
    Pages 32-45
  5. Graph languages defined by systems of forbidden structures: A survey

    • Volker Blödel, Frank Wankmüller
    Pages 46-58
  6. A sweepcircle algorithm for Voronoi diagrams

    • Frank Dehne, Rolf Klein
    Pages 59-69
  7. Competitive location in the L1 and Linf metrics

    • Ramesh Govindan, Pandu Rangan
    Pages 70-83
  8. Priority search trees in secondary memory (extended abstract)

    • Ch. Icking, R. Klein, Th. Ottmann
    Pages 84-93
  9. On the analysis of grid structures for spatial objects of non-zero size

    • Thomas Rottke, Hans-Werner Six, Peter Widmayer
    Pages 94-105
  10. Maintenance of transitive closures and transitive reductions of graphs

    • J. A. La Poutré, J. van Leeuwen
    Pages 106-120
  11. Upward drawings of acyclic digraphs

    • Giuseppe Di Battista, Roberto Tamassia
    Pages 121-133
  12. Development of several reachability algorithms for directed graphs

    • Rudolf Berghammer, Herbert Ehler, Hans Zierer
    Pages 206-218
  13. On integration mechanisms within a graph-based software development environment

    • C. Lewerentz, M. Nagl, B. Westfechtel
    Pages 219-229

About this book

This book reflects the scientific program of the annual workshop on Graph-theoretic Concepts in Computer Science in 1987. The purpose of this conference is to be the "missing link" between theory and application of graphs in as many branches of computer science as a conference scheduled for three days without parallel sessions can permit. So the organizers of WG '87 addressed a selected group of people with a strong interest in theory and practice. The proceedings include latest results on "classical" graph-theoretic problems (including formal language theory applied to graphs) and how to apply those results to practical problems, e.g. data bases, layout of graph operating systems, software engineering, chemistry, and modelling with graphs.


  • Algorithms
  • Automat
  • Graph
  • algorithm
  • classification
  • computer
  • computer science
  • data structure
  • data structures
  • database
  • distributed systems
  • formal language
  • operating system
  • algorithm analysis and problem complexity

Bibliographic Information

  • Book Title: Graph-Theoretic Concepts in Computer Science

  • Book Subtitle: International Workshop WG '87, Kloster Banz/Staffelstein, FRG, June 29 - July 1, 1987. Proceedings

  • Editors: Herbert Göttler, Hana-Jürgen Schneider

  • Series Title: Lecture Notes in Computer Science

  • DOI:

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1988

  • Softcover ISBN: 978-3-540-19422-4Published: 08 June 1988

  • eBook ISBN: 978-3-540-39264-4Published: 30 June 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: VIII, 256

  • Topics: Theory of Computation, Mathematics, Algorithms

Buying options

Softcover Book USD 99.00
Price excludes VAT (USA)