Algorithmic aspects of graph connectivity:
Algorithmic Aspects of Graph Connectivity is the first comprehensive book on this central notion in graph and network theory, emphasizing its algorithmic aspects. Because of its wide applications in the fields of communication, transportation, and production, graph connectivity has made tremendous a...
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Weitere beteiligte Personen: | |
| Format: | E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2008
|
| Schriftenreihe: | Encyclopedia of mathematics and its applications
volume 123 |
| Links: | https://doi.org/10.1017/CBO9780511721649 |
| Zusammenfassung: | Algorithmic Aspects of Graph Connectivity is the first comprehensive book on this central notion in graph and network theory, emphasizing its algorithmic aspects. Because of its wide applications in the fields of communication, transportation, and production, graph connectivity has made tremendous algorithmic progress under the influence of the theory of complexity and algorithms in modern computer science. The book contains various definitions of connectivity, including edge-connectivity and vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts. The authors thoroughly discuss new concepts and algorithms that allow for quicker and more efficient computing, such as maximum adjacency ordering of vertices. Covering both basic definitions and advanced topics, this book can be used as a textbook in graduate courses in mathematical sciences, such as discrete mathematics, combinatorics, and operations research, and as a reference book for specialists in discrete mathematics and its applications. |
| Umfang: | 1 Online-Ressource (xv, 375 Seiten) |
| ISBN: | 9780511721649 |
Internformat
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9780511721649 | ||
| 003 | UkCbUP | ||
| 005 | 20151005020624.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 100303s2008||||enk o ||1 0|eng|d | ||
| 020 | |a 9780511721649 | ||
| 100 | 1 | |a Nagamochi, Hiroshi |d 1960- | |
| 245 | 1 | 0 | |a Algorithmic aspects of graph connectivity |c Hiroshi Nagamochi, Toshihide Ibaraki |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2008 | |
| 300 | |a 1 Online-Ressource (xv, 375 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 490 | 1 | |a Encyclopedia of mathematics and its applications |v volume 123 | |
| 520 | |a Algorithmic Aspects of Graph Connectivity is the first comprehensive book on this central notion in graph and network theory, emphasizing its algorithmic aspects. Because of its wide applications in the fields of communication, transportation, and production, graph connectivity has made tremendous algorithmic progress under the influence of the theory of complexity and algorithms in modern computer science. The book contains various definitions of connectivity, including edge-connectivity and vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts. The authors thoroughly discuss new concepts and algorithms that allow for quicker and more efficient computing, such as maximum adjacency ordering of vertices. Covering both basic definitions and advanced topics, this book can be used as a textbook in graduate courses in mathematical sciences, such as discrete mathematics, combinatorics, and operations research, and as a reference book for specialists in discrete mathematics and its applications. | ||
| 700 | 1 | |a Ibaraki, Toshihide | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780521878647 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/CBO9780511721649 |3 Volltext |
| 912 | |a ZDB-20-CTM | ||
| 912 | |a ZDB-20-CTM | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-20-CTM-CR9780511721649 |
|---|---|
| _version_ | 1825574050066333697 |
| adam_text | |
| any_adam_object | |
| author | Nagamochi, Hiroshi 1960- |
| author2 | Ibaraki, Toshihide |
| author2_role | |
| author2_variant | t i ti |
| author_facet | Nagamochi, Hiroshi 1960- Ibaraki, Toshihide |
| author_role | |
| author_sort | Nagamochi, Hiroshi 1960- |
| author_variant | h n hn |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-20-CTM |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01872nam a2200265 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9780511721649</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20151005020624.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">100303s2008||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511721649</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nagamochi, Hiroshi</subfield><subfield code="d">1960-</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithmic aspects of graph connectivity</subfield><subfield code="c">Hiroshi Nagamochi, Toshihide Ibaraki</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xv, 375 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Encyclopedia of mathematics and its applications</subfield><subfield code="v">volume 123</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Algorithmic Aspects of Graph Connectivity is the first comprehensive book on this central notion in graph and network theory, emphasizing its algorithmic aspects. Because of its wide applications in the fields of communication, transportation, and production, graph connectivity has made tremendous algorithmic progress under the influence of the theory of complexity and algorithms in modern computer science. The book contains various definitions of connectivity, including edge-connectivity and vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts. The authors thoroughly discuss new concepts and algorithms that allow for quicker and more efficient computing, such as maximum adjacency ordering of vertices. Covering both basic definitions and advanced topics, this book can be used as a textbook in graduate courses in mathematical sciences, such as discrete mathematics, combinatorics, and operations research, and as a reference book for specialists in discrete mathematics and its applications.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ibaraki, Toshihide</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780521878647</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/CBO9780511721649</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-20-CTM-CR9780511721649 |
| illustrated | Not Illustrated |
| indexdate | 2025-03-03T11:58:04Z |
| institution | BVB |
| isbn | 9780511721649 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (xv, 375 Seiten) |
| psigel | ZDB-20-CTM TUM_PDA_CTM ZDB-20-CTM |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Encyclopedia of mathematics and its applications |
| spelling | Nagamochi, Hiroshi 1960- Algorithmic aspects of graph connectivity Hiroshi Nagamochi, Toshihide Ibaraki Cambridge Cambridge University Press 2008 1 Online-Ressource (xv, 375 Seiten) txt c cr Encyclopedia of mathematics and its applications volume 123 Algorithmic Aspects of Graph Connectivity is the first comprehensive book on this central notion in graph and network theory, emphasizing its algorithmic aspects. Because of its wide applications in the fields of communication, transportation, and production, graph connectivity has made tremendous algorithmic progress under the influence of the theory of complexity and algorithms in modern computer science. The book contains various definitions of connectivity, including edge-connectivity and vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts. The authors thoroughly discuss new concepts and algorithms that allow for quicker and more efficient computing, such as maximum adjacency ordering of vertices. Covering both basic definitions and advanced topics, this book can be used as a textbook in graduate courses in mathematical sciences, such as discrete mathematics, combinatorics, and operations research, and as a reference book for specialists in discrete mathematics and its applications. Ibaraki, Toshihide Erscheint auch als Druck-Ausgabe 9780521878647 |
| spellingShingle | Nagamochi, Hiroshi 1960- Algorithmic aspects of graph connectivity |
| title | Algorithmic aspects of graph connectivity |
| title_auth | Algorithmic aspects of graph connectivity |
| title_exact_search | Algorithmic aspects of graph connectivity |
| title_full | Algorithmic aspects of graph connectivity Hiroshi Nagamochi, Toshihide Ibaraki |
| title_fullStr | Algorithmic aspects of graph connectivity Hiroshi Nagamochi, Toshihide Ibaraki |
| title_full_unstemmed | Algorithmic aspects of graph connectivity Hiroshi Nagamochi, Toshihide Ibaraki |
| title_short | Algorithmic aspects of graph connectivity |
| title_sort | algorithmic aspects of graph connectivity |
| work_keys_str_mv | AT nagamochihiroshi algorithmicaspectsofgraphconnectivity AT ibarakitoshihide algorithmicaspectsofgraphconnectivity |