TY  - BOOK
AU  - Nagamochi, Hiroshi
AU  - Nagamochi, Hiroshi
AU  - Ibaraki, Toshihide
TI  - Algorithmic Aspects of Graph Connectivity
SN  - 9781108735490
U1  - 511.5 NAG 
PY  - 2008///
CY  - New York 
PB  - : Cambridge University Press, 
KW  - Mathematics
KW  - General principles of mathematics
KW  - Graph connectivity
KW  - Graph algorithms
KW  - Mathematics -- General
KW  - Algorithmische Geometrie
KW  - Graphentheorie
N1  - 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
N2  - "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
ER  -