Skip to main content
SpringerLink
Log in

Graph-Theoretic Concepts in Computer Science

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

  • Conference proceedings
  • © 1988

Overview

Editors:
  1. Herbert Göttler
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Hana-Jürgen Schneider
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (19 papers)

  1. Front Matter

    Download chapter PDF

  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. Approximate counting, uniform generation and rapidly mixing markov chains extended abstract

    • Alistair Sinclair, Mark Jerrum
    Pages 134-148

  13. On chaotic behaviour of some np-complete problems

    • Juergen Perl
    Pages 149-161

  14. External labeling and algorithms for hierarchic networks

    • Aarni Perko
    Pages 162-170

  15. Designing gamma-acyclic database schemes using decomposition and augmentation techniques

    • Dietmar Seipel, Detlev Ruland
    Pages 171-185

  16. Graph-theoretical tools and their use in a practical distributed operating system design case

    • Horst F. Wedde, Douglas C. Daniels
    Pages 186-205

  17. Development of several reachability algorithms for directed graphs

    • Rudolf Berghammer, Herbert Ehler, Hans Zierer
    Pages 206-218

  18. On integration mechanisms within a graph-based software development environment

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

  19. Restructuring aspect graphs into aspect- and cell-equivalence classes for use in computer vision

    • John Stewman, Louise Stark, Kevin Bowyer
    Pages 230-241

  20. Automatic crystal chemical classification of silicates using direction-labeled graphs

    • K. Goetzke, H. -J. Klein, P. Kandzia
    Pages 242-254
Back to top

Keywords

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.

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: https://doi.org/10.1007/3-540-19422-3

  • 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, general, Algorithm Analysis and Problem Complexity

Publish with us

Policies and ethics

Back to top

Search

Navigation