Skip to main content
  • Conference proceedings
  • © 1995

Graph-Theoretic Concepts in Computer Science

20th International Workshop. WG '94, Herrsching, Germany, June 16 - 18, 1994. Proceedings

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

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

Conference proceedings info: WG 1994.

Buy it now

Buying options

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

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (32 papers)

  1. Front Matter

  2. Domino treewidth

    • Hans L. Bodlaender, Joost Engelfriet
    Pages 1-13
  3. A lower bound for treewidth and its consequences

    • Siddharthan Ramachandramurthi
    Pages 14-25
  4. A declarative approach to graph based modeling

    • Jürgen Ebert, Angelika Franzke
    Pages 38-50
  5. Multilevel graph grammars

    • Francesco Parisi-Presicce, Gabriele Piersanti
    Pages 51-64
  6. The algorithmic use of hypertree structure and maximum neighbourhood orderings

    • Andreas Brandstädt, Victor D. Chepoi, Feodor F. Dragan
    Pages 65-80
  7. On domination elimination orderings and domination graphs

    • Elias Dahihaus, Peter Hammer, Frédéric Maffray, Stephan Olariu
    Pages 81-92
  8. Complexity of graph covering problems

    • Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle
    Pages 93-105
  9. Dominoes

    • T. Kloks, D. Kratsch, H. Müller
    Pages 106-120
  10. GLB-closures in directed acyclic graphs and their applications

    • Volker Turau, Weimin Chen
    Pages 121-129
  11. Cartesian products of graphs as spanning subgraphs of de Bruijn graphs

    • Thomas Andreae, Michael Nölle, Gerald Schreiber
    Pages 140-150
  12. Time-optimal tree computations on sparse meshes

    • D. Bhagavathi, V. Bokka, H. Gurla, S. Olariu, J. L. Schwing
    Pages 193-205
  13. Prefix graphs and their applications

    • Shiva Chaudhuri, Torben Hagerup
    Pages 206-218
  14. The complexity of broadcasting in planar and decomposable graphs

    • Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
    Pages 219-231

Other Volumes

  1. Graph-Theoretic Concepts in Computer Science

About this book

This volume presents the proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '94), held in Herrsching, Germany in June 1994.
The volume contains 32 thoroughly revised papers selected from 66 submissions and provides an up-to-date snapshot of the research performed in the field. The topics addressed are graph grammars, treewidth, special graph classes, algorithms on graphs, broadcasting and architecture, planar graphs and related problems, and special graph problems.

Bibliographic Information

Buy it now

Buying options

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