Data structures and algorithms. 2, Graph algorithms and NP-completeness [electronic resource] / Kurt Mehlhorn.
Saved in:
| Online Access: |
Full Text (via Springer) Full Text (via Springer) |
|---|---|
| Main Author: | |
| Format: | Electronic eBook |
| Language: | English German |
| Published: |
Berlin ; New York :
Springer-Verlag,
1984.
|
| Series: | EATCS monographs on theoretical computer science ;
2. |
| Subjects: |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | b7992846 | ||
| 006 | m o d | ||
| 007 | cr ||||||||||| | ||
| 008 | 121227s1984 gw a ob 001 0 eng d | ||
| 005 | 20241104190200.5 | ||
| 019 | |a 934984091 |a 968667061 | ||
| 020 | |a 9783642698972 |q (electronic bk.) | ||
| 020 | |a 3642698972 |q (electronic bk.) | ||
| 020 | |z 9783642698996 |q (print) | ||
| 020 | |z 3642698999 |q (print) | ||
| 020 | |z 354013302X | ||
| 020 | |z 9783540133025 | ||
| 020 | |z 038713302X |q (U.S.) | ||
| 020 | |z 9780387133027 |q (U.S.) | ||
| 024 | 7 | |a 10.1007/978-3-642-69897-2 |2 doi | |
| 029 | 1 | |a AU@ |b 000051701349 | |
| 029 | 1 | |a NZ1 |b 15001421 | |
| 029 | 1 | |a NZ1 |b 15305698 | |
| 035 | |a (OCoLC)spr840294481 | ||
| 035 | |a (OCoLC)840294481 |z (OCoLC)934984091 |z (OCoLC)968667061 | ||
| 037 | |a spr978-3-642-69672-5 | ||
| 040 | |a I9W |b eng |e pn |c I9W |d OCLCO |d UV0 |d OCLCO |d GW5XE |d OCLCF |d UA@ |d COO |d ORU |d OCLCQ |d EBLCP |d OCLCQ |d YDX |d UAB |d OCLCQ |d LEAUB |d AU@ |d OCLCQ |d UKAHL |d OCLCO |d OCLCQ |d OCLCO |d OCLCL |d OCLCQ | ||
| 041 | 1 | |a eng |h ger | |
| 049 | |a GWRE | ||
| 050 | 4 | |a QA76.9.D35 |b M43 1984 | |
| 100 | 1 | |a Mehlhorn, Kurt, |d 1949- |0 http://id.loc.gov/authorities/names/n82270631 |1 https://id.oclc.org/worldcat/entity/E39PBJy8qkfFKq3H8WFqY34g8C |1 http://isni.org/isni/0000000109113341 | |
| 245 | 1 | 0 | |a Data structures and algorithms. |n 2, |p Graph algorithms and NP-completeness |h [electronic resource] / |c Kurt Mehlhorn. |
| 260 | |a Berlin ; |a New York : |b Springer-Verlag, |c 1984. | ||
| 300 | |a 1 online resource (xii, 260 pages) : |b illustrations. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a volume |b nc |2 rdacarrier | ||
| 490 | 1 | |a EATCS Monographs on Theoretical Computer Science, 1431-2654 ; |v 2 | |
| 505 | 0 | |a 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. | |
| 500 | |a Revised translation of: Effiziente Algorithmen. Stuttgart : Teubner, 1977. | ||
| 504 | |a Includes bibliographical references and indexes. | ||
| 650 | 0 | |a Computer programming. |0 http://id.loc.gov/authorities/subjects/sh85107310 | |
| 650 | 0 | |a Algorithms. |0 http://id.loc.gov/authorities/subjects/sh85003487 | |
| 650 | 0 | |a Data structures (Computer science) |0 http://id.loc.gov/authorities/subjects/sh85035862 | |
| 650 | 7 | |a Algorithms. |2 fast | |
| 650 | 7 | |a Computer programming. |2 fast | |
| 650 | 7 | |a Data structures (Computer science) |2 fast | |
| 758 | |i has work: |a Data structures and algorithms II (Text) |1 https://id.oclc.org/worldcat/entity/E39PCGTY9r7yBc8Cv8wXX3xpWC |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Printed edition: |z 9783642698996 |
| 856 | 4 | 0 | |u https://colorado.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-642-69672-5 |z Full Text (via Springer) |
| 856 | 4 | 0 | |u https://colorado.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-642-69897-2 |z Full Text (via Springer) |
| 830 | 0 | |a EATCS monographs on theoretical computer science ; |v 2. |0 http://id.loc.gov/authorities/names/n84742022 | |
| 915 | |a - | ||
| 936 | |a BATCHLOAD | ||
| 944 | |a MARS - RDA ENRICHED | ||
| 956 | |a Springer e-books | ||
| 956 | |b Springer Nature - Springer Book Archive - Springer Computer Science | ||
| 994 | |a 92 |b COD | ||
| 998 | |b WorldCat record encoding level change | ||
| 999 | f | f | |i 6488ab26-a67b-5f1c-968f-525a4cf5968f |s f508d1fe-dc3e-516f-803e-ff1b41cfa89c |
| 952 | f | f | |p Can circulate |a University of Colorado Boulder |b Online |c Online |d Online |e QA76.9.D35 M43 1984 |h Library of Congress classification |i Ebooks, Prospector |n 1 |