000			01903nam a22003017a 4500
005			20220908130013.0
008			220408b |||||||| |||| 00| 0 eng d
020			_a9781108735490
028			_a:Zafaa Books & Distributors _b:313/56F 49A, Anand Nagar Inderlok Delhi 110035 _c;ZBD0019 _d:04/04/2022
082			_a511.5 NAG
100			_aNagamochi, Hiroshi
245			_aAlgorithmic Aspects of Graph Connectivity _c/ Hiroshi Nagamochi;
260			_aNew York _b: Cambridge University Press, _c2008.
300			_axv, 375p _c24cm.
365			_b3454
505			_aMaximum 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 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
650			_aMathematics
650			_aGeneral principles of mathematics
650			_aGraph connectivity.
650			_aGraph algorithms.
650			_aMathematics -- General.
650			_aAlgorithmische Geometrie
650			_aGraphentheorie
700			_aNagamochi, Hiroshi
700			_aIbaraki, Toshihide
942			_cBOOK
999			_c59091 _d59091