Skip to main content
  • Conference proceedings
  • © 1997

Graph-Theoretic Concepts in Computer Science

22nd International Workshop, WG '96, Cadenabbia, Italy, June 12-14, 1996, Proceedings

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

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

Conference proceedings info: WG 1996.

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

  1. Front Matter

  2. Hypergraphs and decision trees

    • Andrew C. Yao
    Pages 1-1
  3. A new characterization of P 4-connected graphs

    • Luitpold Babel, Stephan Olariu
    Pages 17-30
  4. Node rewriting in hypergraphs

    • Michel Bauderon, Hélène Jacquet
    Pages 31-43
  5. On κ-partitioning the n-cube

    • Sergej L. Bezrukov
    Pages 44-55
  6. Embedding complete binary trees in product graphs

    • Adrienne Broadwater, Kemal Efe, Antonio Fernández
    Pages 56-66
  7. Clique and anticlique partitions of graphs

    • Krzysztof BryÅ›, Zbigniew Lonc
    Pages 67-72
  8. Optimal parallel routing in star graphs

    • Chi-Chang Chen, Jianer Chen
    Pages 73-84
  9. Counting edges in a dag

    • Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese
    Pages 85-100
  10. Closure properties of context-free Hyperedge Replacement Systems

    • Ornella Ciotti, Francesco Parisi-Presicce
    Pages 101-113
  11. Upward drawings of search trees

    • P. Crescenzi, P. Penna
    Pages 114-125
  12. System diagnosis with smallest risk of error

    • Krzysztof Diks, Andrzej Pelc
    Pages 141-150
  13. LexBFS-orderings and powers of graphs

    • Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt
    Pages 166-180
  14. Switchbox routing in VLSI design: Closing the complexity gap

    • Stephan Hartmann, Markus W. Schäffter, Andreas S. Schulz
    Pages 196-210
  15. Detecting diamond necklaces in labeled dags

    • Michel Hurfin, Michel Raynal
    Pages 211-223

Other Volumes

  1. Graph-Theoretic Concepts in Computer Science

About this book

This book constitutes the carefully refereed post-proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG '96, held in Cadenabbia, Italy, in June 1996.
The 30 revised full papers presented in the volume were selected from a total of 65 submissions. This collection documents the state of the art in the area. Among the topics addressed are graph algorithms, graph rewriting, hypergraphs, graph drawing, networking, approximation and optimization, trees, graph computation, and others.

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