Skip to main content
SpringerLink
Log in

Graph-Theoretic Concepts in Computer Science

International Workshop WG '86 Bernried, Federal Republic of Germany, June 17-19, 1986, Proceedings

  • Conference proceedings
  • © 1987

Overview

Editors:
  1. Gottfried Tinhofer
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Gunther Schmidt
    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 246)

Included in the following conference series:

Conference proceedings info: WG 1986.

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 (22 papers)

  1. Front Matter

    Download chapter PDF

  2. A simple linear-time algorithm to recognize interval graphs

    • Norbert Korte, Rolf H. Möhring
    Pages 1-16

  3. On approximation algorithms for Steiner's problem in graphs

    • Peter Widmayer
    Pages 17-28

  4. Specification of error distances for graphs by precedence graph grammars and fast recognition of similarity

    • Manfred Kaul
    Pages 29-40

  5. ADA concurrency specified by graph grammars

    • Manfred Jackel
    Pages 41-57

  6. Cabri, an interactive system for graph manipulation

    • M. Dao, M. Habib, J. P. Richard, D. Tallot
    Pages 58-67

  7. An interactive graphical manipulation system for higher objects based on relational algebra

    • Hans Zierer, Gunther Schmidt, Rudolf Berghammer
    Pages 68-81

  8. Behaviour preserving refinements of Petri nets

    • Walter Vogler
    Pages 82-93

  9. The bandwidth of planar distributive lattices

    • Ulrich Faigle, Gerhard Gierz
    Pages 94-105

  10. The node visit cost of brother trees

    • Rolf Klein, Derick Wood
    Pages 106-117

  11. Searching connected components in very large grid graphs

    • S. Abramowski, H. Müller
    Pages 118-130

  12. A simple implementation of Warshall's algorithm on a vlsi chip

    • Ramesh Dewangan, C. Pandu Rangan
    Pages 131-145

  13. On some generalizations of outerplanar graphs: Results and open problems

    • Maciej M. SysÅ‚o
    Pages 146-164

  14. Recognizing outerplanar graphs in linear time

    • Manfred Wiegers
    Pages 165-176

  15. Graphs and graph polynomials of interest in chemistry

    • Ivan Gutman
    Pages 177-187

  16. Applications of parallel scheduling to perfect graphs

    • David Helmbold, Ernst Mayr
    Pages 188-203

  17. A graph-theoretic approach for designing fair distributed resource scheduling algorithms

    • Horst F. Wedde
    Pages 204-226

  18. Improved diameter bounds for altered graphs

    • A. A. Schoone, H. L. Bodlaender, J. van Leeuwen
    Pages 227-236

  19. Separability of sets of polygons

    • Frank Dehne, Jörg-Rüdiger Sack
    Pages 237-251

  20. Centipede graphs and visibility on a cylinder

    • Roberto Tamassia, Ioannis G. Tollis
    Pages 252-263
Back to top

Other volumes

  1. Graph-Theoretic Concepts in Computer Science

Keywords

About this book

Graph-theoretic concepts are developed by computer scientists in order to model algorithms, nets, rewriting systems, distributed systems, parallelism, geometric and layout concepts. Their complexity is studied under various randomness assumptions. This volume contains contributions to the twelfth of a series of annual workshops designed to bring together researchers using graph-theoretic methods. Its purpose is to broadcast emerging new developments from and to a diversity of application fields. The topics covered include: Graph Grammars, Graph Manipulation, Nets, Complexity Issues, Algorithmic and Network Considerations, Outerplanar Graphs, Graph Isomorphism, Parallelism and Distributed Systems, Graphs and Geometry, Randomness Considerations, Applications in Chemistry, Specific Algorithms. N

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation