Skip to main content
  • Conference proceedings
  • © 1990

Graph-Theoretic Concepts in Computer Science

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


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

Buying options

Softcover Book USD 109.00
Price excludes VAT (USA)

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

Table of contents (26 papers)

  1. Front Matter

  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. Graph rewriting systems with priorities

    • Michel Billaud, Pierre Lafon, Yves Metivier, Eric Sopena
    Pages 94-106
  6. Filtering hyperedge-replacement languages through compatible properties

    • Annegret Habel, Hans-Jörg Kreowski
    Pages 107-120
  7. A parser for context free plex grammars

    • H. Bunke, B. Haller
    Pages 136-150
  8. On the complexity of optimal drawings of graphs

    • Franz J. Brandenburg
    Pages 166-180
  9. Beyond Steiner's problem: A VLSI oriented generalization

    • Gabriele Reich, Peter Widmayer
    Pages 196-210
  10. On feedback problems in digraphs

    • Ewald Speckenmeyer
    Pages 218-231
  11. Paging binary trees with external balancing

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

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.


  • Action
  • Algorithms
  • Digraph
  • Graph
  • Graph theory
  • Sim
  • VLSI
  • algorithm
  • complexity
  • data structure
  • data structures
  • distributed systems
  • modeling
  • processor
  • software engineering
  • combinatorics
  • algorithm analysis and problem complexity

Bibliographic Information

Buying options

Softcover Book USD 109.00
Price excludes VAT (USA)