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

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

Author: Kurt Mehlhorn
Publisher: Berlin ; New York : Springer-Verlag, 1984.
Series: EATCS monographs on theoretical computer science, 2.
Edition/Format:   eBook : Document : EnglishView all editions and formats
Rating:

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

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

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

Details

Genre/Form: Electronic books
Additional Physical Format: Printed edition:
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Kurt Mehlhorn
ISBN: 9783642698972 3642698972
OCLC Number: 840294481
Notes: Rev. translation of: Effiziente Algorithmen. Stuttgart : Teubner, 1977.
Description: 1 online resource (xii, 260 pages) : illustrations.
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 --
8. Minimum Spanning Trees --
9. Maximum Network Flow and Applications --
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 --
7. Approximation Algorithms --
8. The Landscape of Complexity Classes --
9. Exercises --
10. Bibliographic Notes --
IX. Algorithmic Paradigms.
Series Title: EATCS monographs on theoretical computer science, 2.
Responsibility: Kurt Mehlhorn.

Reviews

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

Tags

Be the first.
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/840294481> # Data structures and algorithms. 2, Graph algorithms and NP-completeness
    a schema:MediaObject, schema:CreativeWork, schema:Book ;
   bgn:translationOfWork <http://www.worldcat.org/title/-/oclc/840294481#CreativeWork/unidentifiedOriginalWork> ;
   library:oclcnum "840294481" ;
   library:placeOfPublication <http://dbpedia.org/resource/New_York_City> ; # New York
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/2643436802#Place/berlin> ; # Berlin
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
   schema:about <http://id.worldcat.org/fast/887978> ; # Data structures (Computer science)
   schema:about <http://id.worldcat.org/fast/872390> ; # Computer programming
   schema:about <http://dewey.info/class/004.0151/e23/> ;
   schema:about <http://id.worldcat.org/fast/805020> ; # Algorithms
   schema:bookFormat schema:EBook ;
   schema:creator <http://viaf.org/viaf/67022101> ; # Kurt Mehlhorn
   schema:datePublished "1984" ;
   schema:description "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 -- 8. Minimum Spanning Trees -- 9. Maximum Network Flow and Applications -- 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 -- 7. Approximation Algorithms -- 8. The Landscape of Complexity Classes -- 9. Exercises -- 10. Bibliographic Notes -- IX. Algorithmic Paradigms."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/2643436802> ;
   schema:genre "Electronic books"@en ;
   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:isPartOf <http://experiment.worldcat.org/entity/work/data/2643436802#Series/eatcs_monographs_on_theoretical_computer_science_1431_2654> ; # EATCS Monographs on Theoretical Computer Science, 1431-2654 ;
   schema:isSimilarTo <http://worldcat.org/entity/work/data/2643436802#CreativeWork/> ;
   schema:name "Data structures and algorithms. 2, Graph algorithms and NP-completeness"@en ;
   schema:productID "840294481" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/840294481#PublicationEvent/berlin_new_york_springer_verlag_1984> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/2643436802#Agent/springer_verlag> ; # Springer-Verlag
   schema:url <http://link.springer.com/10.1007/978-3-642-69897-2> ;
   schema:url <http://public.eblib.com/choice/publicfullrecord.aspx?p=3090999> ;
   schema:url <http://dx.doi.org/10.1007/978-3-642-69897-2> ;
   schema:workExample <http://dx.doi.org/10.1007/978-3-642-69897-2> ;
   schema:workExample <http://worldcat.org/isbn/9783642698972> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/840294481> ;
    .


Related Entities

<http://dbpedia.org/resource/New_York_City> # New York
    a schema:Place ;
   schema:name "New York" ;
    .

<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#Series/eatcs_monographs_on_theoretical_computer_science> # EATCS monographs on theoretical computer science ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/840294481> ; # Data structures and algorithms. 2, Graph algorithms and NP-completeness
   schema:name "EATCS monographs on theoretical computer science ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/2643436802#Series/eatcs_monographs_on_theoretical_computer_science_1431_2654> # EATCS Monographs on Theoretical Computer Science, 1431-2654 ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/840294481> ; # Data structures and algorithms. 2, Graph algorithms and NP-completeness
   schema:name "EATCS Monographs on Theoretical Computer Science, 1431-2654 ;" ;
    .

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

<http://id.worldcat.org/fast/872390> # Computer programming
    a schema:Intangible ;
   schema:name "Computer programming"@en ;
    .

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

<http://link.springer.com/10.1007/978-3-642-69897-2>
   rdfs:comment "from Springer" ;
   rdfs:comment "(Unlimited Concurrent Users)" ;
    .

<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/entity/work/data/2643436802#CreativeWork/>
    a schema:CreativeWork ;
   schema:description "Printed edition:" ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/840294481> ; # Data structures and algorithms. 2, Graph algorithms and NP-completeness
    .

<http://worldcat.org/isbn/9783642698972>
    a schema:ProductModel ;
   schema:isbn "3642698972" ;
   schema:isbn "9783642698972" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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