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 t...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge [u.a.]
Cambridge Univ. Press
2012
|
| Ausgabe: | 2. ed. |
| Schlagworte: | |
| Online-Zugang: | Cover Inhaltsverzeichnis Inhaltsverzeichnis |
| 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: | Literaturangaben |
| Beschreibung: | XII, 189 S. graph. Darst. |
| ISBN: | 0521736536 9780521736534 0521517184 9780521517188 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV040118902 | ||
| 003 | DE-604 | ||
| 005 | 20120824 | ||
| 007 | t | ||
| 008 | 120507s2012 d||| |||| 00||| eng d | ||
| 010 | |a 2011037984 | ||
| 020 | |a 0521736536 |c pbk. |9 0-521-73653-6 | ||
| 020 | |a 9780521736534 |c pbk. |9 978-0-521-73653-4 | ||
| 020 | |a 0521517184 |c hbk. |9 0-521-51718-4 | ||
| 020 | |a 9780521517188 |c hbk. |9 978-0-521-51718-8 | ||
| 035 | |a (OCoLC)796215003 | ||
| 035 | |a (DE-599)GBV668111569 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-20 |a DE-92 |a DE-1028 |a DE-634 |a DE-M158 | ||
| 082 | 0 | |a 511.5 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 100 | 1 | |a Even, Shimon |d 1935-2004 |e Verfasser |0 (DE-588)110882695 |4 aut | |
| 245 | 1 | 0 | |a Graph algorithms |c Shimon Even. Ed. by Guy Even |
| 250 | |a 2. ed. | ||
| 264 | 1 | |a Cambridge [u.a.] |b Cambridge Univ. Press |c 2012 | |
| 300 | |a XII, 189 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Literaturangaben | ||
| 520 | 1 | |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 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |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 | |5 DE-604 | |
| 689 | 1 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 689 | 2 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 2 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Even, Guy |e Sonstige |4 oth | |
| 856 | 4 | |u http://assets.cambridge.org/97805215/17188/cover/9780521517188.jpg |3 Cover | |
| 856 | 4 | |m DE-601 |q pdf/application |u http://www.gbv.de/dms/tib-ub-hannover/668111569.pdf |3 Inhaltsverzeichnis | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024975052&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-024975052 | ||
| 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 | |
Datensatz im Suchindex
| _version_ | 1804149077500231680 |
|---|---|
| adam_text | Titel: Graph algorithms
Autor: Even, Shimon
Jahr: 2012
Contents
Foreword by Richard M. Karp page vii
Preface to the Second Edition ix
Preface to the First Edition xi
1 Paths in Graphs 1
1.1 Introduction to Graph Theory 1
1.2 Computer Representation of Graphs 3
1.3 Euler Graphs 6
1.4 De Bruijn Sequences 9
1.5 Shortest-Path Algorithms 11
1.6 Problems 22
2 Trees 29
2.1 Tree Definitions 29
2.2 Minimum Spanning Tree 31
2.3 Cayley s Theorem 34
2.4 Directed Tree Definitions 37
2.5 The Infinity Lemma 39
2.6 Problems 42
3 Depth-First Search 46
3.1 DFS of Undirected Graphs 46
3.2 Algorithm for Nonseparable Components 52
3.3 DFS on Directed Graphs 57
3.4 Strongly Connected Components of a Digraph 58
3.5 Problems 62
4 Ordered Trees 65
4.1 Uniquely Decipherable Codes 65
4.2 Positional Trees and Huffman s Optimization Problem 69
vi Contents
4.3 Application of the Huffman Tree to Sort-by-Merge
Techniques 75
4.4 Catalan Numbers 77
4.5 Problems 82
5 Flow in Networks 85
5.1 Introduction 85
5.2 The Algorithm of Ford and Fulkerson 87
5.3 The Dinitz Algorithm 94
5.4 Networks with Upper and Lower Bounds 102
5.5 Problems 109
5.6 Notes by Andrew Goldberg 115
6 Applications of Network Flow Techniques 117
6.1 Zero-One Network Flow 117
6.2 Vertex Connectivity of Graphs 121
6.3 Connectivity of Digraphs and Edge Connectivity 129
6.4 Maximum Matching in Bipartite Graphs 135
6.5 Two Problems on PERT Digraphs 137
6.6 Problems 141
7 Planar Graphs 146
7.1 Bridges and Kuratowski s Theorem 146
7.2 Equivalence 157
7.3 Euler s Theorem 158
7.4 Duality 159
7.5 Problems 164
8 Testing Graph Planarity 168
8.1 Introduction 168
8.2 The Path Addition Algorithm of Hopcroft and Tarjan 169
8.3 Computing an st-Numbering 177
8.4 The Vertex Addition Algorithm of Lempel, Even, and
Cederbaum 179
8.5 Problems 185
Index 187
|
| any_adam_object | 1 |
| author | Even, Shimon 1935-2004 |
| author_GND | (DE-588)110882695 |
| author_facet | Even, Shimon 1935-2004 |
| author_role | aut |
| author_sort | Even, Shimon 1935-2004 |
| author_variant | s e se |
| building | Verbundindex |
| bvnumber | BV040118902 |
| classification_rvk | SK 890 |
| ctrlnum | (OCoLC)796215003 (DE-599)GBV668111569 |
| 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.5 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| edition | 2. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02999nam a2200565 c 4500</leader><controlfield tag="001">BV040118902</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20120824 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">120507s2012 d||| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2011037984</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521736536</subfield><subfield code="c">pbk.</subfield><subfield code="9">0-521-73653-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521736534</subfield><subfield code="c">pbk.</subfield><subfield code="9">978-0-521-73653-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521517184</subfield><subfield code="c">hbk.</subfield><subfield code="9">0-521-51718-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521517188</subfield><subfield code="c">hbk.</subfield><subfield code="9">978-0-521-51718-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)796215003</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV668111569</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-20</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-1028</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-M158</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.5</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="d">1935-2004</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)110882695</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. Ed. by Guy Even</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge [u.a.]</subfield><subfield code="b">Cambridge Univ. Press</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 189 S.</subfield><subfield code="b">graph. Darst.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="520" ind1="1" 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="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">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">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="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="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="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">1\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">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Even, Guy</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://assets.cambridge.org/97805215/17188/cover/9780521517188.jpg</subfield><subfield code="3">Cover</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="m">DE-601</subfield><subfield code="q">pdf/application</subfield><subfield code="u">http://www.gbv.de/dms/tib-ub-hannover/668111569.pdf</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024975052&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024975052</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></record></collection> |
| id | DE-604.BV040118902 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T00:17:18Z |
| institution | BVB |
| isbn | 0521736536 9780521736534 0521517184 9780521517188 |
| language | English |
| lccn | 2011037984 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024975052 |
| oclc_num | 796215003 |
| open_access_boolean | |
| owner | DE-20 DE-92 DE-1028 DE-634 DE-M158 |
| owner_facet | DE-20 DE-92 DE-1028 DE-634 DE-M158 |
| physical | XII, 189 S. graph. Darst. |
| publishDate | 2012 |
| publishDateSearch | 2012 |
| publishDateSort | 2012 |
| publisher | Cambridge Univ. Press |
| record_format | marc |
| spelling | Even, Shimon 1935-2004 Verfasser (DE-588)110882695 aut Graph algorithms Shimon Even. Ed. by Guy Even 2. ed. Cambridge [u.a.] Cambridge Univ. Press 2012 XII, 189 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Literaturangaben "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"-- Algorithmus (DE-588)4001183-5 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Graphentheorie (DE-588)4113782-6 gnd rswk-swf Graphentheorie (DE-588)4113782-6 s Algorithmus (DE-588)4001183-5 s DE-604 Komplexitätstheorie (DE-588)4120591-1 s 1\p DE-604 Graph (DE-588)4021842-9 s 2\p DE-604 Even, Guy Sonstige oth http://assets.cambridge.org/97805215/17188/cover/9780521517188.jpg Cover DE-601 pdf/application http://www.gbv.de/dms/tib-ub-hannover/668111569.pdf Inhaltsverzeichnis HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024975052&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 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 |
| spellingShingle | Even, Shimon 1935-2004 Graph algorithms Algorithmus (DE-588)4001183-5 gnd Graph (DE-588)4021842-9 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Graphentheorie (DE-588)4113782-6 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4021842-9 (DE-588)4120591-1 (DE-588)4113782-6 |
| title | Graph algorithms |
| title_auth | Graph algorithms |
| title_exact_search | Graph algorithms |
| title_full | Graph algorithms Shimon Even. Ed. by Guy Even |
| title_fullStr | Graph algorithms Shimon Even. Ed. by Guy Even |
| title_full_unstemmed | Graph algorithms Shimon Even. Ed. by Guy Even |
| title_short | Graph algorithms |
| title_sort | graph algorithms |
| topic | Algorithmus (DE-588)4001183-5 gnd Graph (DE-588)4021842-9 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Graphentheorie (DE-588)4113782-6 gnd |
| topic_facet | Algorithmus Graph Komplexitätstheorie Graphentheorie |
| url | http://assets.cambridge.org/97805215/17188/cover/9780521517188.jpg http://www.gbv.de/dms/tib-ub-hannover/668111569.pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024975052&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT evenshimon graphalgorithms AT evenguy graphalgorithms |
Es ist kein Print-Exemplar vorhanden.
Inhaltsverzeichnis