LEADER 00000cam a2200709Ki 4500 
001    ocn857769743 
003    OCoLC 
005    20190405013609.3 
006    m     o  d         
007    cr cnu---unuuu 
008    130909s2008    enka    ob    001 0 eng d 
019    726827635|a776951249|a863709971|a1065711469 
020    9781461941569|q(electronic book) 
020    1461941563|q(electronic book) 
020    9780511721649|q(e-book) 
020    0511721641|q(e-book) 
020    |z9780521878647 
020    |z0521878640 
035    (OCoLC)857769743|z(OCoLC)726827635|z(OCoLC)776951249
       |z(OCoLC)863709971|z(OCoLC)1065711469 
037    CL0500000340|bSafari Books Online 
040    N$T|beng|erda|epn|cN$T|dE7B|dIDEBK|dUMI|dOCLCO|dYDXCP
       |dDEBBG|dAUD|dLTU|dOCLCF|dOCLCQ|dDEBSZ|dUIU|dOCLCO|dOCLCQ
       |dUAB|dOCLCQ|dCEF|dOCLCA|dWYU 
049    RIDW 
050  4 QA166.243|b.N34 2008eb 
072  7 MAT|x000000|2bisacsh 
082 04 511/.5|222 
084    31.12|2bcl 
084    DAT 537f|2stub 
084    MAT 055f|2stub 
084    SK 890|2rvk 
084    05-02|2msc 
090    QA166.243|b.N34 2008eb 
100 1  Nagamochi, Hiroshi,|d1960-|0https://id.loc.gov/authorities
       /names/n2008011846 
245 10 Algorithmic aspects of graph connectivity /|cHiroshi 
       Nagamochi, Toshihide Ibaraki. 
264  1 Cambridge ;|aNew York :|bCambridge University Press,
       |c2008. 
300    1 online resource (xv, 375 pages) :|billustrations. 
336    text|btxt|2rdacontent 
337    computer|bc|2rdamedia 
338    online resource|bcr|2rdacarrier 
340    |gpolychrome|2rdacc 
347    text file|2rdaft 
490 1  Encyclopedia of mathematics and its applications ;|v123 
504    Includes bibliographical references (pages 357-369) and 
       index. 
505 0  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  "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  Print version record. 
590    eBooks on EBSCOhost|bEBSCO eBook Subscription Academic 
       Collection - North America 
650  0 Graph connectivity.|0https://id.loc.gov/authorities/
       subjects/sh2008001302 
650  0 Graph algorithms.|0https://id.loc.gov/authorities/subjects
       /sh2002004605 
650  7 Graph connectivity.|2fast|0https://id.worldcat.org/fast/
       1745205 
650  7 Graph algorithms.|2fast|0https://id.worldcat.org/fast/
       946581 
655  0 Electronic book. 
655  4 Electronic books. 
700 1  Ibaraki, Toshihide.|0https://id.loc.gov/authorities/names/
       n50031966 
776 08 |iPrint version:|aNagamochi, Hiroshi, 1960-|tAlgorithmic 
       aspects of graph connectivity|z9780521878647|w(DLC)  
       2008007560|w(OCoLC)212015401 
830  0 Encyclopedia of mathematics and its applications ;|0https:
       //id.loc.gov/authorities/names/n42010632|vv. 123. 
856 40 |uhttps://rider.idm.oclc.org/login?url=http://
       search.ebscohost.com/login.aspx?direct=true&scope=site&
       db=nlebk&AN=616975|zOnline eBook via EBSCO. Access 
       restricted to current Rider University students, faculty, 
       and staff. 
856 42 |3Instructions for reading/downloading the EBSCO version 
       of this eBook|uhttp://guides.rider.edu/ebooks/ebsco 
901    MARCIVE 20231220 
948    |d20190507|cEBSCO|tEBSCOebooksacademic NEW 4-5-19 7552
       |lridw 
994    92|bRID