Algorithmic aspects of graph connectivity / Hiroshi Nagamochi, Toshihide Ibaraki.
Nagamochi, Hiroshi, 1960-| Call Number | 511/.5 |
| Author | Nagamochi, Hiroshi, 1960- author. |
| Title | Algorithmic aspects of graph connectivity / Hiroshi Nagamochi, Toshihide Ibaraki. |
| Physical Description | 1 online resource (xv, 375 pages) : digital, PDF file(s). |
| Series | Encyclopedia of mathematics and its applications ; volume 123 |
| Notes | Title from publisher's bibliographic system (viewed on 05 Oct 2015). |
| 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. |
| Summary | 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. |
| Added Author | Ibaraki, Toshihide, author. |
| Subject | GRAPH CONNECTIVITY. Graph algorithms. |
| Multimedia |
Total Ratings:
0
02713nam a22003978i 4500
001
vtls001584815
003
VRT
005
20200921122100.0
006
m|||||o||d||||||||
007
cr||||||||||||
008
200921s2008||||enk o ||1 0|eng|d
020
$a 9780511721649 (ebook)
020
$z 9780521878647 (hardback)
035
$a (UkCbUP)CR9780511721649
039
9
$y 202009211221 $z santha
040
$a UkCbUP $b eng $e rda $c UkCbUP
050
0
0
$a QA166.243 $b .N34 2008
082
0
0
$a 511/.5 $2 22
100
1
$a Nagamochi, Hiroshi, $d 1960- $e author.
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) : $b digital, PDF file(s).
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 volume 123
500
$a Title from publisher's bibliographic system (viewed on 05 Oct 2015).
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
$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
0
$a GRAPH CONNECTIVITY.
650
0
$a Graph algorithms.
700
1
$a Ibaraki, Toshihide, $e author.
776
0
8
$i Print version: $z 9780521878647
830
0
$a Encyclopedia of mathematics and its applications ; $v v. 123.
856
4
0
$u https://doi.org/10.1017/CBO9780511721649
999
$a VIRTUA
No Reviews to Display
| Summary | 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. |
| Notes | Title from publisher's bibliographic system (viewed on 05 Oct 2015). |
| 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. |
| Subject | GRAPH CONNECTIVITY. Graph algorithms. |
| Multimedia |