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

Graph-Theoretic Concepts in Computer Science

International Workshop WG `88 Amsterdam, The Netherlands, June 15-17, 1988. Proceedings

Editors:

  1. J. Leeuwen
    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 344)

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

Conference proceedings info: WG 1988.

Sections

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

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

Table of contents (31 papers)

  1. Front Matter

    PDF

  2. NC-algorithms for graphs with small treewidth

    • Hans L. Bodlaender
    Pages 1-10

  6. Fault tolerant networks of specified diameter

    • H. Meijer, R. Dawes
    Pages 74-86

  7. DFS tree construction: Algorithms and characterizations

    • Ephraim Korach, Zvi Ostfeld
    Pages 87-106

  8. Serializable graphs

    • K. Vidyasankar
    Pages 107-121

  9. Transitive closure algorithms for very large databases

    • Joachim Biskup, Holger Stiefeling
    Pages 122-147

  13. Dominance in the presence of obstacles

    • Mark T. de Berg, Mark H. Overmars
    Pages 190-201

  16. Moving regular k-gons in contact

    • Stephan Abramowski, Bruno Lang, Heinrich Müller
    Pages 229-242

  17. Epsilon-nets for halfplanes

    • Gerhart Woeginger
    Pages 243-252

  19. A simple systolic method to find all bridges of an undirected graph

    • Manfred Schimmler, Heiko Schröder
    Pages 262-267

  20. Colouring perfect planar graphs in parallel

    • Iain A. Stewart
    Pages 268-275
Back to top

Other Volumes

  1. Graph-Theoretic Concepts in Computer Science

Back to top

About this book

This volume presents the proceedings of the 14th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '88), held from June 15 to 17, 1988 in Amsterdam, The Netherlands. It contains 31 papers on new or current developments in the area of graph-based algorithms. The topics covered include e.g. structural graph theory, parallel graph algorithms, graph-based modeling (in database theory and VLSI), computational geometry and applied graph theory. The book contains the revised versions of all the papers presented at the workshop. The revisions are based on comments and suggestions received by the authors during and after the workshop.
Back to top

Keywords

  • Computer
  • Graph
  • Graph theory
  • Sim
  • Triangulation
  • algorithm
  • algorithms
  • computational geometry
  • logic
  • modeling
  • topology
  • combinatorics
  • algorithm analysis and problem complexity
  • data structures
Back to top

Bibliographic Information

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