Skip to main content
  • Textbook
  • © 1984

Data Structures and Algorithms 2

Graph Algorithms and NP-Completeness

Authors:

Part of the book series: Monographs in Theoretical Computer Science. An EATCS Series (EATCS, volume 2)

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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 (4 chapters)

  1. Front Matter

    Pages I-XII
  2. Algorithms on Graphs

    • Kurt Mehlhorn
    Pages 1-132
  3. NP-Completeness

    • Kurt Mehlhorn
    Pages 171-243
  4. Algorithmic Paradigms

    • Kurt Mehlhorn
    Pages 244-251
  5. Back Matter

    Pages 252-262

Authors and Affiliations

  • FB 10, Angewandte Mathematik und Informatik, Universität des Saarlandes, Saarbrücken, Germany

    Kurt Mehlhorn

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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