Skip to main content
Book cover
  • Conference proceedings
  • © 1987

Graph-Theoretic Concepts in Computer Science

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

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)

Conference series link(s): WG: International Workshop on Graph-Theoretic Concepts in Computer Science

Conference proceedings info: WG 1986.

Sections

Softcover Book USD 109.00
Price excludes VAT (USA)
Learn about institutional subscriptions

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

Table of contents (22 papers)

  1. Front Matter

    PDF

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

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

  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

  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

  14. Recognizing outerplanar graphs in linear time

    • Manfred Wiegers
    Pages 165-176

  16. Applications of parallel scheduling to perfect graphs

    • David Helmbold, Ernst Mayr
    Pages 188-203

  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

Back to top

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
Back to top

Keywords

  • Algorithms
  • Graph
  • Node
  • Sim
  • algorithm
  • complexity
  • data model
  • distributed systems
  • petri net
  • sets
  • combinatorics
Back to top

Bibliographic Information

  • Book Title: Graph-Theoretic Concepts in Computer Science

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

  • Editors: Gottfried Tinhofer, Gunther Schmidt

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-17218-1

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1987

  • Softcover ISBN: 978-3-540-17218-5Published: 08 April 1987

  • eBook ISBN: 978-3-540-47415-9Published: 14 July 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: X, 314

  • Topics: Theory of Computation, Discrete Mathematics, Computer Communication Networks

Back to top
Access via your institution
Softcover Book USD 109.00
Price excludes VAT (USA)
Learn about institutional subscriptions