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:
| Hauptverfasser: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2008
|
| Schriftenreihe: | Encyclopedia of mathematics and its applications
volume 123 |
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 UPA01 Volltext |
| 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 |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Beschreibung: | 1 online resource (xv, 375 pages) |
| ISBN: | 9780511721649 |
| DOI: | 10.1017/CBO9780511721649 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043941685 | ||
| 003 | DE-604 | ||
| 005 | 20230720 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s2008 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511721649 |c Online |9 978-0-511-72164-9 | ||
| 024 | 7 | |a 10.1017/CBO9780511721649 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511721649 | ||
| 035 | |a (OCoLC)992914271 | ||
| 035 | |a (DE-599)BVBBV043941685 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 |a DE-739 | ||
| 082 | 0 | |a 511/.5 |2 22 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 100 | 1 | |a Nagamochi, Hiroshi |d 1960- |e Verfasser |0 (DE-588)170968871 |4 aut | |
| 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 resource (xv, 375 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Encyclopedia of mathematics and its applications |v volume 123 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 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 | ||
| 650 | 4 | |a Graph connectivity | |
| 650 | 4 | |a Graph algorithms | |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 0 | 1 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 1 | 1 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Ibaraki, Toshihide |e Verfasser |0 (DE-588)170695255 |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-87864-7 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511721649 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029350655 | ||
| 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 | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511721649 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511721649 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511721649 |l UPA01 |p ZDB-20-CBO |q UPA_PDA_CBO_Kauf2019 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176883748700160 |
|---|---|
| any_adam_object | |
| author | Nagamochi, Hiroshi 1960- Ibaraki, Toshihide |
| author_GND | (DE-588)170968871 (DE-588)170695255 |
| author_facet | Nagamochi, Hiroshi 1960- Ibaraki, Toshihide |
| author_role | aut aut |
| author_sort | Nagamochi, Hiroshi 1960- |
| author_variant | h n hn t i ti |
| building | Verbundindex |
| bvnumber | BV043941685 |
| classification_rvk | SK 890 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9780511721649 (OCoLC)992914271 (DE-599)BVBBV043941685 |
| 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/CBO9780511721649 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03523nmm a2200577zcb4500</leader><controlfield tag="001">BV043941685</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230720 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2008 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511721649</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-72164-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511721649</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511721649</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)992914271</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043941685</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><subfield code="a">DE-739</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5</subfield><subfield code="2">22</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">Nagamochi, Hiroshi</subfield><subfield code="d">1960-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)170968871</subfield><subfield code="4">aut</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 resource (xv, 375 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="490" ind1="0" ind2=" "><subfield code="a">Encyclopedia of mathematics and its applications</subfield><subfield code="v">volume 123</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="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="650" ind1=" " ind2="4"><subfield code="a">Graph connectivity</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">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-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="689" ind1="0" 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="0" ind2="1"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</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">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</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="700" ind1="1" ind2=" "><subfield code="a">Ibaraki, Toshihide</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)170695255</subfield><subfield code="4">aut</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-87864-7</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511721649</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-029350655</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="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511721649</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/CBO9780511721649</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><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511721649</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">UPA_PDA_CBO_Kauf2019</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043941685 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:16Z |
| institution | BVB |
| isbn | 9780511721649 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029350655 |
| oclc_num | 992914271 |
| open_access_boolean | |
| owner | DE-12 DE-92 DE-739 |
| owner_facet | DE-12 DE-92 DE-739 |
| physical | 1 online resource (xv, 375 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO ZDB-20-CBO UPA_PDA_CBO_Kauf2019 |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Encyclopedia of mathematics and its applications |
| spelling | Nagamochi, Hiroshi 1960- Verfasser (DE-588)170968871 aut Algorithmic aspects of graph connectivity Hiroshi Nagamochi, Toshihide Ibaraki Cambridge Cambridge University Press 2008 1 online resource (xv, 375 pages) txt rdacontent c rdamedia cr rdacarrier Encyclopedia of mathematics and its applications volume 123 Title from publisher's bibliographic system (viewed on 05 Oct 2015) 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 Graph connectivity Graph algorithms Graph (DE-588)4021842-9 gnd rswk-swf Algorithmische Geometrie (DE-588)4130267-9 gnd rswk-swf Graphentheorie (DE-588)4113782-6 gnd rswk-swf Graph (DE-588)4021842-9 s Algorithmische Geometrie (DE-588)4130267-9 s 1\p DE-604 Graphentheorie (DE-588)4113782-6 s 2\p DE-604 Ibaraki, Toshihide Verfasser (DE-588)170695255 aut Erscheint auch als Druckausgabe 978-0-521-87864-7 https://doi.org/10.1017/CBO9780511721649 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 |
| spellingShingle | Nagamochi, Hiroshi 1960- Ibaraki, Toshihide Algorithmic aspects of graph connectivity Graph connectivity Graph algorithms Graph (DE-588)4021842-9 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Graphentheorie (DE-588)4113782-6 gnd |
| subject_GND | (DE-588)4021842-9 (DE-588)4130267-9 (DE-588)4113782-6 |
| 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 |
| topic | Graph connectivity Graph algorithms Graph (DE-588)4021842-9 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Graphentheorie (DE-588)4113782-6 gnd |
| topic_facet | Graph connectivity Graph algorithms Graph Algorithmische Geometrie Graphentheorie |
| url | https://doi.org/10.1017/CBO9780511721649 |
| work_keys_str_mv | AT nagamochihiroshi algorithmicaspectsofgraphconnectivity AT ibarakitoshihide algorithmicaspectsofgraphconnectivity |