Algorithmic aspects of graph connectivity /:
"Algorithmic Aspects of Graph Connectivity is the first book that thoroughly discusses graph connectivity, a central notion in graph and network theory, emphasizing its algorithmic aspects. This book contains various definitions of connectivity, including edge-connectivity, vertex-connectivity,...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge ; New York :
Cambridge University Press,
2008.
|
| Schriftenreihe: | Encyclopedia of mathematics and its applications ;
v. 123. |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | "Algorithmic Aspects of Graph Connectivity is the first book that thoroughly discusses graph connectivity, a central notion in graph and network theory, emphasizing its algorithmic aspects. This book contains various definitions of connectivity, including edge-connectivity, vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts." "Covering both basic definitions and advanced topics, this book can be used as a textbook in graduate courses of mathematical sciences (such as discrete mathematics, combinatorics, and operations research) in addition to being an important reference book for all specialists working in discrete mathematics and its applications."--Jacket |
| Beschreibung: | 1 online resource (xv, 375 pages) : illustrations |
| Bibliographie: | Includes bibliographical references (pages 357-369) and index. |
| ISBN: | 9781461941569 1461941563 9780511721649 0511721641 1139883429 9781139883429 1107384087 9781107384088 1107387590 9781107387591 0511839138 9780511839139 1107398924 9781107398924 1107390516 9781107390515 1107395313 9781107395312 |
Internformat
MARC
| LEADER | 00000cam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn857769743 | ||
| 003 | OCoLC | ||
| 005 | 20240705115654.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 130909s2008 enka ob 001 0 eng d | ||
| 040 | |a N$T |b eng |e rda |e pn |c N$T |d E7B |d IDEBK |d UMI |d OCLCO |d YDXCP |d DEBBG |d AUD |d LTU |d OCLCF |d OCLCQ |d DEBSZ |d UIU |d OCLCO |d OCLCQ |d UAB |d OCLCQ |d CEF |d OCLCA |d WYU |d UKAHL |d OL$ |d OCLCQ |d A6Q |d VLY |d LUN |d OCLCQ |d OCLCO |d OCLCQ |d OCLCO |d OCLCL |d SFB |d OCLCQ | ||
| 019 | |a 726827635 |a 776951249 |a 863709971 |a 1065711469 |a 1162416609 |a 1167509332 |a 1241790884 |a 1242483259 | ||
| 020 | |a 9781461941569 |q (electronic bk.) | ||
| 020 | |a 1461941563 |q (electronic bk.) | ||
| 020 | |a 9780511721649 |q (e-book) | ||
| 020 | |a 0511721641 |q (e-book) | ||
| 020 | |a 1139883429 | ||
| 020 | |a 9781139883429 | ||
| 020 | |a 1107384087 | ||
| 020 | |a 9781107384088 | ||
| 020 | |a 1107387590 | ||
| 020 | |a 9781107387591 | ||
| 020 | |a 0511839138 | ||
| 020 | |a 9780511839139 | ||
| 020 | |a 1107398924 | ||
| 020 | |a 9781107398924 | ||
| 020 | |a 1107390516 | ||
| 020 | |a 9781107390515 | ||
| 020 | |a 1107395313 | ||
| 020 | |a 9781107395312 | ||
| 020 | |z 9780521878647 | ||
| 020 | |z 0521878640 | ||
| 035 | |a (OCoLC)857769743 |z (OCoLC)726827635 |z (OCoLC)776951249 |z (OCoLC)863709971 |z (OCoLC)1065711469 |z (OCoLC)1162416609 |z (OCoLC)1167509332 |z (OCoLC)1241790884 |z (OCoLC)1242483259 | ||
| 037 | |a CL0500000340 |b Safari Books Online | ||
| 050 | 4 | |a QA166.243 |b .N34 2008eb | |
| 072 | 7 | |a MAT |x 000000 |2 bisacsh | |
| 082 | 7 | |a 511/.5 |2 22 | |
| 084 | |a 31.12 |2 bcl | ||
| 084 | |a 05-02 |2 msc | ||
| 084 | |a SK 890 |2 rvk | ||
| 084 | |a DAT 537f |2 stub | ||
| 084 | |a MAT 055f |2 stub | ||
| 049 | |a MAIN | ||
| 100 | 1 | |a Nagamochi, Hiroshi, |d 1960- |1 https://id.oclc.org/worldcat/entity/E39PCjtrt8dCRFYPQFGkddH6cd |0 http://id.loc.gov/authorities/names/n2008011846 | |
| 245 | 1 | 0 | |a Algorithmic aspects of graph connectivity / |c Hiroshi Nagamochi, Toshihide Ibaraki. |
| 264 | 1 | |a Cambridge ; |a New York : |b Cambridge University Press, |c 2008. | |
| 300 | |a 1 online resource (xv, 375 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Encyclopedia of mathematics and its applications ; |v 123 | |
| 504 | |a Includes bibliographical references (pages 357-369) and index. | ||
| 505 | 0 | |a Maximum adjacency ordering and forest decompositions -- Minimum cuts -- Cut enumeration -- Cactus representations -- Extreme vertex sets -- Edge splitting -- Connectivity augmentation -- Source location problems -- Submodular and posimodular set functions. | |
| 520 | 1 | |a "Algorithmic Aspects of Graph Connectivity is the first book that thoroughly discusses graph connectivity, a central notion in graph and network theory, emphasizing its algorithmic aspects. This book contains various definitions of connectivity, including edge-connectivity, vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts." "Covering both basic definitions and advanced topics, this book can be used as a textbook in graduate courses of mathematical sciences (such as discrete mathematics, combinatorics, and operations research) in addition to being an important reference book for all specialists working in discrete mathematics and its applications."--Jacket | |
| 588 | 0 | |a Print version record. | |
| 610 | 2 | 7 | |a Graduiertenakademie Pädagogische Hochschulen |g Karlsruhe |2 gnd |0 http://d-nb.info/gnd/1163293377 |
| 650 | 0 | |a Graph connectivity. |0 http://id.loc.gov/authorities/subjects/sh2008001302 | |
| 650 | 0 | |a Graph algorithms. |0 http://id.loc.gov/authorities/subjects/sh2002004605 | |
| 650 | 6 | |a Connectivité des graphes. | |
| 650 | 6 | |a Algorithmes de graphes. | |
| 650 | 7 | |a MATHEMATICS |x General. |2 bisacsh | |
| 650 | 7 | |a Graph algorithms |2 fast | |
| 650 | 7 | |a Graph connectivity |2 fast | |
| 650 | 7 | |a Algorithmische Geometrie |2 gnd |0 http://d-nb.info/gnd/4130267-9 | |
| 650 | 7 | |a Graphentheorie |2 gnd |0 http://d-nb.info/gnd/4113782-6 | |
| 700 | 1 | |a Ibaraki, Toshihide. |0 http://id.loc.gov/authorities/names/n50031966 | |
| 776 | 0 | 8 | |i Print version: |a Nagamochi, Hiroshi, 1960- |t Algorithmic aspects of graph connectivity |z 9780521878647 |w (DLC) 2008007560 |w (OCoLC)212015401 |
| 830 | 0 | |a Encyclopedia of mathematics and its applications ; |v v. 123. |0 http://id.loc.gov/authorities/names/n42010632 | |
| 856 | 1 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=616975 |3 Volltext | |
| 856 | 1 | |l CBO01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=616975 |3 Volltext | |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH26385205 | ||
| 938 | |a ebrary |b EBRY |n ebr10461662 | ||
| 938 | |a EBSCOhost |b EBSC |n 616975 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n cis26244529 | ||
| 938 | |a YBP Library Services |b YANK |n 11338548 | ||
| 938 | |a YBP Library Services |b YANK |n 11117867 | ||
| 938 | |a YBP Library Services |b YANK |n 3583273 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn857769743 |
|---|---|
| _version_ | 1813903620912971776 |
| adam_text | |
| any_adam_object | |
| author | Nagamochi, Hiroshi, 1960- |
| author2 | Ibaraki, Toshihide |
| author2_role | |
| author2_variant | t i ti |
| author_GND | http://id.loc.gov/authorities/names/n2008011846 http://id.loc.gov/authorities/names/n50031966 |
| author_facet | Nagamochi, Hiroshi, 1960- Ibaraki, Toshihide |
| author_role | |
| author_sort | Nagamochi, Hiroshi, 1960- |
| author_variant | h n hn |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA166 |
| callnumber-raw | QA166.243 .N34 2008eb |
| callnumber-search | QA166.243 .N34 2008eb |
| callnumber-sort | QA 3166.243 N34 42008EB |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 890 |
| classification_tum | DAT 537f MAT 055f |
| collection | ZDB-4-EBA |
| contents | Maximum adjacency ordering and forest decompositions -- Minimum cuts -- Cut enumeration -- Cactus representations -- Extreme vertex sets -- Edge splitting -- Connectivity augmentation -- Source location problems -- Submodular and posimodular set functions. |
| ctrlnum | (OCoLC)857769743 |
| 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 | Informatik Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04906cam a2200901 i 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn857769743</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20240705115654.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">130909s2008 enka ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">E7B</subfield><subfield code="d">IDEBK</subfield><subfield code="d">UMI</subfield><subfield code="d">OCLCO</subfield><subfield code="d">YDXCP</subfield><subfield code="d">DEBBG</subfield><subfield code="d">AUD</subfield><subfield code="d">LTU</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">UIU</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UAB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">CEF</subfield><subfield code="d">OCLCA</subfield><subfield code="d">WYU</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OL$</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">A6Q</subfield><subfield code="d">VLY</subfield><subfield code="d">LUN</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">SFB</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">726827635</subfield><subfield code="a">776951249</subfield><subfield code="a">863709971</subfield><subfield code="a">1065711469</subfield><subfield code="a">1162416609</subfield><subfield code="a">1167509332</subfield><subfield code="a">1241790884</subfield><subfield code="a">1242483259</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461941569</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1461941563</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511721649</subfield><subfield code="q">(e-book)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511721641</subfield><subfield code="q">(e-book)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139883429</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139883429</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107384087</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107384088</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107387590</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107387591</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511839138</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511839139</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107398924</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107398924</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107390516</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107390515</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107395313</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107395312</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780521878647</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0521878640</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)857769743</subfield><subfield code="z">(OCoLC)726827635</subfield><subfield code="z">(OCoLC)776951249</subfield><subfield code="z">(OCoLC)863709971</subfield><subfield code="z">(OCoLC)1065711469</subfield><subfield code="z">(OCoLC)1162416609</subfield><subfield code="z">(OCoLC)1167509332</subfield><subfield code="z">(OCoLC)1241790884</subfield><subfield code="z">(OCoLC)1242483259</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">CL0500000340</subfield><subfield code="b">Safari Books Online</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA166.243</subfield><subfield code="b">.N34 2008eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">000000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511/.5</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.12</subfield><subfield code="2">bcl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">05-02</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 537f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 055f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nagamochi, Hiroshi,</subfield><subfield code="d">1960-</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCjtrt8dCRFYPQFGkddH6cd</subfield><subfield code="0">http://id.loc.gov/authorities/names/n2008011846</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="a">New York :</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><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Encyclopedia of mathematics and its applications ;</subfield><subfield code="v">123</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (pages 357-369) and index.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Maximum adjacency ordering and forest decompositions -- Minimum cuts -- Cut enumeration -- Cactus representations -- Extreme vertex sets -- Edge splitting -- Connectivity augmentation -- Source location problems -- Submodular and posimodular set functions.</subfield></datafield><datafield tag="520" ind1="1" ind2=" "><subfield code="a">"Algorithmic Aspects of Graph Connectivity is the first book that thoroughly discusses graph connectivity, a central notion in graph and network theory, emphasizing its algorithmic aspects. This book contains various definitions of connectivity, including edge-connectivity, vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts." "Covering both basic definitions and advanced topics, this book can be used as a textbook in graduate courses of mathematical sciences (such as discrete mathematics, combinatorics, and operations research) in addition to being an important reference book for all specialists working in discrete mathematics and its applications."--Jacket</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="610" ind1="2" ind2="7"><subfield code="a">Graduiertenakademie Pädagogische Hochschulen</subfield><subfield code="g">Karlsruhe</subfield><subfield code="2">gnd</subfield><subfield code="0">http://d-nb.info/gnd/1163293377</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Graph connectivity.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh2008001302</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Graph algorithms.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh2002004605</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Connectivité des graphes.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Algorithmes de graphes.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graph algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graph connectivity</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="2">gnd</subfield><subfield code="0">http://d-nb.info/gnd/4130267-9</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="2">gnd</subfield><subfield code="0">http://d-nb.info/gnd/4113782-6</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ibaraki, Toshihide.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n50031966</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Nagamochi, Hiroshi, 1960-</subfield><subfield code="t">Algorithmic aspects of graph connectivity</subfield><subfield code="z">9780521878647</subfield><subfield code="w">(DLC) 2008007560</subfield><subfield code="w">(OCoLC)212015401</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Encyclopedia of mathematics and its applications ;</subfield><subfield code="v">v. 123.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n42010632</subfield></datafield><datafield tag="856" ind1="1" ind2=" "><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=616975</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="1" ind2=" "><subfield code="l">CBO01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=616975</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH26385205</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10461662</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">616975</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">cis26244529</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">11338548</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">11117867</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">3583273</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-ocn857769743 |
| illustrated | Illustrated |
| indexdate | 2024-10-25T16:21:35Z |
| institution | BVB |
| isbn | 9781461941569 1461941563 9780511721649 0511721641 1139883429 9781139883429 1107384087 9781107384088 1107387590 9781107387591 0511839138 9780511839139 1107398924 9781107398924 1107390516 9781107390515 1107395313 9781107395312 |
| language | English |
| oclc_num | 857769743 |
| open_access_boolean | |
| owner | MAIN |
| owner_facet | MAIN |
| physical | 1 online resource (xv, 375 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | Cambridge University Press, |
| record_format | marc |
| series | Encyclopedia of mathematics and its applications ; |
| series2 | Encyclopedia of mathematics and its applications ; |
| spelling | Nagamochi, Hiroshi, 1960- https://id.oclc.org/worldcat/entity/E39PCjtrt8dCRFYPQFGkddH6cd http://id.loc.gov/authorities/names/n2008011846 Algorithmic aspects of graph connectivity / Hiroshi Nagamochi, Toshihide Ibaraki. Cambridge ; New York : Cambridge University Press, 2008. 1 online resource (xv, 375 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier Encyclopedia of mathematics and its applications ; 123 Includes bibliographical references (pages 357-369) and index. Maximum adjacency ordering and forest decompositions -- Minimum cuts -- Cut enumeration -- Cactus representations -- Extreme vertex sets -- Edge splitting -- Connectivity augmentation -- Source location problems -- Submodular and posimodular set functions. "Algorithmic Aspects of Graph Connectivity is the first book that thoroughly discusses graph connectivity, a central notion in graph and network theory, emphasizing its algorithmic aspects. This book contains various definitions of connectivity, including edge-connectivity, vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts." "Covering both basic definitions and advanced topics, this book can be used as a textbook in graduate courses of mathematical sciences (such as discrete mathematics, combinatorics, and operations research) in addition to being an important reference book for all specialists working in discrete mathematics and its applications."--Jacket Print version record. Graduiertenakademie Pädagogische Hochschulen Karlsruhe gnd http://d-nb.info/gnd/1163293377 Graph connectivity. http://id.loc.gov/authorities/subjects/sh2008001302 Graph algorithms. http://id.loc.gov/authorities/subjects/sh2002004605 Connectivité des graphes. Algorithmes de graphes. MATHEMATICS General. bisacsh Graph algorithms fast Graph connectivity fast Algorithmische Geometrie gnd http://d-nb.info/gnd/4130267-9 Graphentheorie gnd http://d-nb.info/gnd/4113782-6 Ibaraki, Toshihide. http://id.loc.gov/authorities/names/n50031966 Print version: Nagamochi, Hiroshi, 1960- Algorithmic aspects of graph connectivity 9780521878647 (DLC) 2008007560 (OCoLC)212015401 Encyclopedia of mathematics and its applications ; v. 123. http://id.loc.gov/authorities/names/n42010632 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=616975 Volltext CBO01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=616975 Volltext |
| spellingShingle | Nagamochi, Hiroshi, 1960- Algorithmic aspects of graph connectivity / Encyclopedia of mathematics and its applications ; Maximum adjacency ordering and forest decompositions -- Minimum cuts -- Cut enumeration -- Cactus representations -- Extreme vertex sets -- Edge splitting -- Connectivity augmentation -- Source location problems -- Submodular and posimodular set functions. Graduiertenakademie Pädagogische Hochschulen Karlsruhe gnd http://d-nb.info/gnd/1163293377 Graph connectivity. http://id.loc.gov/authorities/subjects/sh2008001302 Graph algorithms. http://id.loc.gov/authorities/subjects/sh2002004605 Connectivité des graphes. Algorithmes de graphes. MATHEMATICS General. bisacsh Graph algorithms fast Graph connectivity fast Algorithmische Geometrie gnd http://d-nb.info/gnd/4130267-9 Graphentheorie gnd http://d-nb.info/gnd/4113782-6 |
| subject_GND | http://d-nb.info/gnd/1163293377 http://id.loc.gov/authorities/subjects/sh2008001302 http://id.loc.gov/authorities/subjects/sh2002004605 http://d-nb.info/gnd/4130267-9 http://d-nb.info/gnd/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 | Graduiertenakademie Pädagogische Hochschulen Karlsruhe gnd http://d-nb.info/gnd/1163293377 Graph connectivity. http://id.loc.gov/authorities/subjects/sh2008001302 Graph algorithms. http://id.loc.gov/authorities/subjects/sh2002004605 Connectivité des graphes. Algorithmes de graphes. MATHEMATICS General. bisacsh Graph algorithms fast Graph connectivity fast Algorithmische Geometrie gnd http://d-nb.info/gnd/4130267-9 Graphentheorie gnd http://d-nb.info/gnd/4113782-6 |
| topic_facet | Graduiertenakademie Pädagogische Hochschulen Karlsruhe Graph connectivity. Graph algorithms. Connectivité des graphes. Algorithmes de graphes. MATHEMATICS General. Graph algorithms Graph connectivity Algorithmische Geometrie Graphentheorie |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=616975 |
| work_keys_str_mv | AT nagamochihiroshi algorithmicaspectsofgraphconnectivity AT ibarakitoshihide algorithmicaspectsofgraphconnectivity |