Skip to main content
SpringerLink
Log in

Graph-Theoretic Concepts in Computer Science

15th International Workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings

  • Conference proceedings
  • © 1990

Overview

Editors:
  1. Manfred Nagl
    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 411)

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

  1. Front Matter

    Download chapter PDF

  2. Disjoint paths in the hypercube

    • Seshu Madhavapeddy, I. Hal Sudborough
    Pages 3-18

  3. Time bounds for broadcasting in bounded degree graphs

    • Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro
    Pages 19-33

  4. t/s-Diagnosable systems: A characterization and diagnosis algorithm

    • A. Das, K. Thulasiraman, V. K. Agarwal, K. B. Lakshmanan
    Pages 34-45

  5. Toward a complete representation of graphoids in graphs — Abridged Version

    • Robert Y. Geva, Azaria Paz
    Pages 46-62

  6. CADULA — A graph-based model for monitoring CAD-processes

    • Detlev Ruland
    Pages 63-77

  7. On hyperedge replacement and BNLC graph grammars

    • Walter Vogler
    Pages 78-93

  8. Graph rewriting systems with priorities

    • Michel Billaud, Pierre Lafon, Yves Metivier, Eric Sopena
    Pages 94-106

  9. Filtering hyperedge-replacement languages through compatible properties

    • Annegret Habel, Hans-Jörg Kreowski
    Pages 107-120

  10. Describing distributed systems by categorical graph grammars

    • H. J. Schneider
    Pages 121-135

  11. A parser for context free plex grammars

    • H. Bunke, B. Haller
    Pages 136-150

  12. Introduction to PROGRESS, an attribute graph grammar based specification language

    • Andy Schürr
    Pages 151-165

  13. On the complexity of optimal drawings of graphs

    • Franz J. Brandenburg
    Pages 166-180

  14. Bounds to the page number of partially ordered sets

    • Maciej M. SysÅ‚o
    Pages 181-195

  15. Beyond Steiner's problem: A VLSI oriented generalization

    • Gabriele Reich, Peter Widmayer
    Pages 196-210

  16. A fast sequential and parallel algorithm for the computation of the k-closure of a graph

    • Ingo Schiermeyer
    Pages 211-217

  17. On feedback problems in digraphs

    • Ewald Speckenmeyer
    Pages 218-231

  18. Improved self-reduction algorithms for graphs with bounded treewidth

    • Hans L. Bodlaender
    Pages 232-244

  19. Finding a minimal transitive reduction in a strongly connected digraph within linear time

    • Klaus Simon
    Pages 245-259

  20. Paging binary trees with external balancing

    • Andreas Henrich, Hans-Werner Six, Peter Widmayer
    Pages 260-276
Back to top

Keywords

About this book

The aim of this workshop series is to contribute to integration in computer science by applying graph-theoretic concepts. Commonalities between various fields of specialization in computer science may be detected by applying graph-theoretic concepts. The workshops are unusual in that they combine theoretical aspects with practice and applications. Applications dealt with in this volume include the use of graph-theoretic concepts in distributed and parallel computation, VLSI, CAD, software engineering, computer graphics, data structures, and computational geometry.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation