Skip to main content
  • Conference proceedings
  • © 1981

Graphtheoretic Concepts in Computer Science

Proceedings of the International Workshop WG 80 Bad Honnef, June 15-18, 1980

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

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

  1. Bounding the bandwidth of NP-complete problems

    • Burkhard Monien, Ivan Hal Sudborough
    Pages 279-292
  2. A comparison between petri-nets and graph grammars

    • Hans-Jörg Kreowski
    Pages 306-317
  3. Reachability homomorphisms on nets

    • Jürgen Ebert, Jürgen Perl
    Pages 326-334
  4. A birds eye view to path problems

    • Bernd Mahr
    Pages 335-353
  5. The chinese postman problem for mixed graphs

    • Peter Brucker
    Pages 354-366
  6. Alternating cycle covers and paths

    • Oliver Vornberger
    Pages 367-378
  7. Generating all planar 0-,1-,2-,3-connected graphs

    • Peter Läuchli
    Pages 379-382
  8. Optimal (s,t)-cuts

    • Horst Hamacher
    Pages 383-387

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