Algorithmic aspects of graph connectivity /
Saved in:
| Author / Creator: | Nagamochi, Hiroshi, 1960- |
|---|---|
| Imprint: | Cambridge ; New York : Cambridge University Press, 2008. |
| Description: | 1 online resource (xv, 375 pages) : illustrations |
| Language: | English |
| Series: | Encyclopedia of mathematics and its applications ; 123 Encyclopedia of mathematics and its applications ; v. 123. |
| Subject: | |
| Format: | E-Resource Book |
| URL for this record: | http://pi.lib.uchicago.edu/1001/cat/bib/11831795 |
MARC
| LEADER | 00000cam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | 11831795 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 130909s2008 enka ob 001 0 eng d | ||
| 005 | 20240628211325.2 | ||
| 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 | ||
| 035 | 9 | |a (OCLCCM-CC)857769743 | |
| 037 | |a CL0500000340 |b Safari Books Online | ||
| 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 | ||
| 049 | |a MAIN | ||
| 050 | 4 | |a QA166.243 |b .N34 2008eb | |
| 072 | 7 | |a MAT |x 000000 |2 bisacsh | |
| 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 | ||
| 100 | 1 | |a Nagamochi, Hiroshi, |d 1960- |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 | 7 | |a MATHEMATICS |x General. |2 bisacsh | |
| 650 | 7 | |a Graph algorithms. |2 fast |0 (OCoLC)fst00946581 | |
| 650 | 7 | |a Graph connectivity. |2 fast |0 (OCoLC)fst01745205 | |
| 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 | |
| 655 | 4 | |a Electronic books. | |
| 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 | |
| 903 | |a HeVa | ||
| 929 | |a oclccm | ||
| 999 | f | f | |i eb30ecf1-8896-5339-bae2-e6c10a20b466 |s 22c9ef3f-fbc3-53ba-ba37-4a7a64fd9e5a |
| 928 | |t Library of Congress classification |a QA166.243 .N34 2008eb |l Online |c UC-FullText |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=e000xna&AN=616975 |z eBooks on EBSCOhost |g ebooks |i 12395479 | ||