Graph algorithms:
Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the fir...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2012
|
| Ausgabe: | Second edition |
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 URL des Erstveröffentlichers |
| Zusammenfassung: | Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition and explains algorithms in a formal but simple language with a direct and intuitive presentation. The book begins by covering basic material, including graphs and shortest paths, trees, depth-first-search and breadth-first search. The main part of the book is devoted to network flows and applications of network flows, and it ends with chapters on planar graphs and testing graph planarity |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Beschreibung: | 1 online resource (xii, 189 pages) |
| ISBN: | 9781139015165 |
| DOI: | 10.1017/CBO9781139015165 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043944315 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s2012 |||| o||u| ||||||eng d | ||
| 020 | |a 9781139015165 |c Online |9 978-1-139-01516-5 | ||
| 024 | 7 | |a 10.1017/CBO9781139015165 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9781139015165 | ||
| 035 | |a (OCoLC)967687274 | ||
| 035 | |a (DE-599)BVBBV043944315 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 511/.5 |2 23 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 100 | 1 | |a Even, Shimon |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Graph algorithms |c Shimon Even ; edited by Guy Even |
| 250 | |a Second edition | ||
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2012 | |
| 300 | |a 1 online resource (xii, 189 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 505 | 8 | |a Machine generated contents note: 1. Paths in graphs; 2. Trees; 3. Depth-first search; 4. Ordered trees; 5. Flow in networks; 6. Applications of network flow techniques; 7. Planar graphs; 8. Testing graph planarity | |
| 520 | |a Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition and explains algorithms in a formal but simple language with a direct and intuitive presentation. The book begins by covering basic material, including graphs and shortest paths, trees, depth-first-search and breadth-first search. The main part of the book is devoted to network flows and applications of network flows, and it ends with chapters on planar graphs and testing graph planarity | ||
| 650 | 4 | |a Graph algorithms | |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 689 | 2 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 2 | |8 3\p |5 DE-604 | |
| 700 | 0 | |a Guy Even |4 edt | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-51718-8 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-73653-4 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9781139015165 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029353285 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1017/CBO9781139015165 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9781139015165 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176889081757696 |
|---|---|
| any_adam_object | |
| author | Even, Shimon |
| author2 | Guy Even |
| author2_role | edt |
| author2_variant | g e ge |
| author_facet | Even, Shimon Guy Even |
| author_role | aut |
| author_sort | Even, Shimon |
| author_variant | s e se |
| building | Verbundindex |
| bvnumber | BV043944315 |
| classification_rvk | SK 890 |
| collection | ZDB-20-CBO |
| contents | Machine generated contents note: 1. Paths in graphs; 2. Trees; 3. Depth-first search; 4. Ordered trees; 5. Flow in networks; 6. Applications of network flow techniques; 7. Planar graphs; 8. Testing graph planarity |
| ctrlnum | (ZDB-20-CBO)CR9781139015165 (OCoLC)967687274 (DE-599)BVBBV043944315 |
| dewey-full | 511/.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.5 |
| dewey-search | 511/.5 |
| dewey-sort | 3511 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1017/CBO9781139015165 |
| edition | Second edition |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03324nmm a2200613zc 4500</leader><controlfield tag="001">BV043944315</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2012 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139015165</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-139-01516-5</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9781139015165</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781139015165</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)967687274</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043944315</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Even, Shimon</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graph algorithms</subfield><subfield code="c">Shimon Even ; edited by Guy Even</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Second edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xii, 189 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Machine generated contents note: 1. Paths in graphs; 2. Trees; 3. Depth-first search; 4. Ordered trees; 5. Flow in networks; 6. Applications of network flow techniques; 7. Planar graphs; 8. Testing graph planarity</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition and explains algorithms in a formal but simple language with a direct and intuitive presentation. The book begins by covering basic material, including graphs and shortest paths, trees, depth-first-search and breadth-first search. The main part of the book is devoted to network flows and applications of network flows, and it ends with chapters on planar graphs and testing graph planarity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Guy Even</subfield><subfield code="4">edt</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-51718-8</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-73653-4</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9781139015165</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029353285</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781139015165</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781139015165</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043944315 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:21Z |
| institution | BVB |
| isbn | 9781139015165 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029353285 |
| oclc_num | 967687274 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (xii, 189 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 2012 |
| publishDateSearch | 2012 |
| publishDateSort | 2012 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Even, Shimon Verfasser aut Graph algorithms Shimon Even ; edited by Guy Even Second edition Cambridge Cambridge University Press 2012 1 online resource (xii, 189 pages) txt rdacontent c rdamedia cr rdacarrier Title from publisher's bibliographic system (viewed on 05 Oct 2015) Machine generated contents note: 1. Paths in graphs; 2. Trees; 3. Depth-first search; 4. Ordered trees; 5. Flow in networks; 6. Applications of network flow techniques; 7. Planar graphs; 8. Testing graph planarity Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition and explains algorithms in a formal but simple language with a direct and intuitive presentation. The book begins by covering basic material, including graphs and shortest paths, trees, depth-first-search and breadth-first search. The main part of the book is devoted to network flows and applications of network flows, and it ends with chapters on planar graphs and testing graph planarity Graph algorithms Graph (DE-588)4021842-9 gnd rswk-swf Graphentheorie (DE-588)4113782-6 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Graphentheorie (DE-588)4113782-6 s Algorithmus (DE-588)4001183-5 s 1\p DE-604 Komplexitätstheorie (DE-588)4120591-1 s 2\p DE-604 Graph (DE-588)4021842-9 s 3\p DE-604 Guy Even edt Erscheint auch als Druckausgabe 978-0-521-51718-8 Erscheint auch als Druckausgabe 978-0-521-73653-4 https://doi.org/10.1017/CBO9781139015165 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Even, Shimon Graph algorithms Machine generated contents note: 1. Paths in graphs; 2. Trees; 3. Depth-first search; 4. Ordered trees; 5. Flow in networks; 6. Applications of network flow techniques; 7. Planar graphs; 8. Testing graph planarity Graph algorithms Graph (DE-588)4021842-9 gnd Graphentheorie (DE-588)4113782-6 gnd Algorithmus (DE-588)4001183-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
| subject_GND | (DE-588)4021842-9 (DE-588)4113782-6 (DE-588)4001183-5 (DE-588)4120591-1 |
| title | Graph algorithms |
| title_auth | Graph algorithms |
| title_exact_search | Graph algorithms |
| title_full | Graph algorithms Shimon Even ; edited by Guy Even |
| title_fullStr | Graph algorithms Shimon Even ; edited by Guy Even |
| title_full_unstemmed | Graph algorithms Shimon Even ; edited by Guy Even |
| title_short | Graph algorithms |
| title_sort | graph algorithms |
| topic | Graph algorithms Graph (DE-588)4021842-9 gnd Graphentheorie (DE-588)4113782-6 gnd Algorithmus (DE-588)4001183-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
| topic_facet | Graph algorithms Graph Graphentheorie Algorithmus Komplexitätstheorie |
| url | https://doi.org/10.1017/CBO9781139015165 |
| work_keys_str_mv | AT evenshimon graphalgorithms AT guyeven graphalgorithms |