skip to content
Data structures and agorithms. 2, Graph algorithms and NP-completeness Preview this item
ClosePreview this item
Checking...

Data structures and agorithms. 2, Graph algorithms and NP-completeness

Author: Kurt Mehlhorn
Publisher: Berlin [Germany (West)] : Springer-Verlag, 1984.
Series: EATCS monographs on theoretical computer science, 2.
Edition/Format:   Print book : EnglishView all editions and formats
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Kurt Mehlhorn
ISBN: 354013641X 9783540136415 038713641X 9780387136417
OCLC Number: 35427979
Description: xii, 260 pages.
Contents: Vol. 2: Graph Algorithms and NP-Completeness.- IV. Algorithms on Graphs.- 1. Graphs and their Representation in a Computer.- 2. Topological Sorting and the Representation Problem.- 3. Transitive Closure of Acyclic Digraphs.- 4. Systematic Exploration of a Graph.- 5. A Close Look at Depth First Search.- 6. Strongly-Connected and Biconnected Components of Directed and Undirected Graphs.- 7. Least Cost Paths in Networks.- 7.1. Acyclic Networks.- 7.2. Non-negative Networks.- 7.3. General Networks.- 7.4. The All Pairs Problem.- 8. Minimum Spanning Trees.- 9. Maximum Network Flow and Applications.- 9.1 Algorithms for Maximum Network Flow.- 9.2 (0,1)-Networks, Bipartite Matching and Graph Connectivity.- 9.3 Weighted Network Flow and Weighted Bipartite Matching.- 10. Planar Graphs.- 11. Exercises.- 12. Bibliographic Notes.- V. Path Problems in Graphs and Matrix Multiplication.- 1. General Path Problems.- 2. Two Special Cases: Least Cost Paths and Transitive Closure.- 3. General Path Problems and Matrix Multiplication.- 4. Matrix Multiplication in a Ring.- 5. Boolean Matrix Multiplication and Transitive Closure.- 6. (Min,+)-Product of Matrices and Least Cost Paths.- 7. A Lower Bound on the Monotone Complexity of Matrix Multiplication.- 8. Exercises.- 9. Bibliographic Notes.- VI. NP-Completeness.- 1. Turing Machines and Random Access Machines.- 2. Problems, Languages and Optimization Problems.- 3. Reductions and NP-complete Problems.- 4. The Satisfiability Problem is NP-complete.- 5. More NP-complete Problems.- 6. Solving NP-complete Problems.- 6.1 Dynamic Programming.- 6.2 Branch and Bound.- 7. Approximation Algorithms.- 7.1 Approximation Algorithms for the Travelling Salesman Problem.- 7.2 Approximation Schemes.- 7.3 Full Approximation Schemes.- 8. The Landscape of Complexity Classes.- 9. Exercises.- 10. Bibliographic Notes.- IX. Algorithmic Paradigms.
Series Title: EATCS monographs on theoretical computer science, 2.
Other Titles: Graph algorithms and NP-completeness.
Responsibility: Kurt Mehlhorn.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/35427979> # Data structures and agorithms. 2, Graph algorithms and NP-completeness
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "35427979" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/2643436802#Place/berlin_germany_west> ; # Berlin Germany (West)
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
   rdfs:seeAlso <http://experiment.worldcat.org/entity/work/data/2643436802#CreativeWork/graph_algorithms_and_np_completeness> ; # Graph algorithms and NP-completeness.
   schema:about <http://id.worldcat.org/fast/805020> ; # Algorithms
   schema:about <http://id.worldcat.org/fast/887978> ; # Data structures (Computer science)
   schema:bookFormat bgn:PrintBook ;
   schema:creator <http://viaf.org/viaf/67022101> ; # Kurt Mehlhorn
   schema:datePublished "1984" ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/2643436802> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/2643436802#Series/eatcs_monographs_on_theoretical_computer_science> ; # EATCS monographs on theoretical computer science ;
   schema:name "Data structures and agorithms. 2, Graph algorithms and NP-completeness"@en ;
   schema:productID "35427979" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/35427979#PublicationEvent/berlin_germany_west_springer_verlag_1984> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/2643436802#Agent/springer_verlag> ; # Springer-Verlag
   schema:workExample <http://worldcat.org/isbn/9780387136417> ;
   schema:workExample <http://worldcat.org/isbn/9783540136415> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/35427979> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/2643436802#Agent/springer_verlag> # Springer-Verlag
    a bgn:Agent ;
   schema:name "Springer-Verlag" ;
    .

<http://experiment.worldcat.org/entity/work/data/2643436802#CreativeWork/graph_algorithms_and_np_completeness> # Graph algorithms and NP-completeness.
    a schema:CreativeWork ;
   schema:name "Graph algorithms and NP-completeness." ;
    .

<http://experiment.worldcat.org/entity/work/data/2643436802#Place/berlin_germany_west> # Berlin Germany (West)
    a schema:Place ;
   schema:name "Berlin Germany (West)" ;
    .

<http://experiment.worldcat.org/entity/work/data/2643436802#Series/eatcs_monographs_on_theoretical_computer_science> # EATCS monographs on theoretical computer science ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/35427979> ; # Data structures and agorithms. 2, Graph algorithms and NP-completeness
   schema:name "EATCS monographs on theoretical computer science ;" ;
    .

<http://id.worldcat.org/fast/805020> # Algorithms
    a schema:Intangible ;
   schema:name "Algorithms"@en ;
    .

<http://id.worldcat.org/fast/887978> # Data structures (Computer science)
    a schema:Intangible ;
   schema:name "Data structures (Computer science)"@en ;
    .

<http://viaf.org/viaf/67022101> # Kurt Mehlhorn
    a schema:Person ;
   schema:birthDate "1949" ;
   schema:familyName "Mehlhorn" ;
   schema:givenName "Kurt" ;
   schema:name "Kurt Mehlhorn" ;
    .

<http://worldcat.org/isbn/9780387136417>
    a schema:ProductModel ;
   schema:isbn "038713641X" ;
   schema:isbn "9780387136417" ;
    .

<http://worldcat.org/isbn/9783540136415>
    a schema:ProductModel ;
   schema:isbn "354013641X" ;
   schema:isbn "9783540136415" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.