Skip to main content
Springer Nature Link
Log in

Data Structures and Algorithms 2

Graph Algorithms and NP-Completeness

  • Textbook
  • © 1984

Overview

Authors:
  1. Kurt Mehlhorn

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

    View author publications

    You can also search for this author in PubMed   Google Scholar

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

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (4 chapters)

  1. Front Matter

    Pages I-XII
    Download chapter PDF

  2. Algorithms on Graphs

    • Kurt Mehlhorn
    Pages 1-132

  3. Path Problems in Graphs and Matrix Multiplication

    • Kurt Mehlhorn
    Pages 133-170

  4. NP-Completeness

    • Kurt Mehlhorn
    Pages 171-243

  5. Algorithmic Paradigms

    • Kurt Mehlhorn
    Pages 244-251

  6. Back Matter

    Pages 252-262
    Download chapter PDF
Back to top

Authors and Affiliations

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

    Kurt Mehlhorn

Bibliographic Information

Publish with us

Policies and ethics

Back to top