01903nam a22003017a 4500 20220908130013.0 220408b |||||||| |||| 00| 0 eng d 9781108735490 :Zafaa Books & Distributors :313/56F 49A, Anand Nagar Inderlok Delhi 110035 ;ZBD0019 :04/04/2022 511.5 NAG Nagamochi, Hiroshi Algorithmic Aspects of Graph Connectivity / Hiroshi Nagamochi; New York : Cambridge University Press, 2008. xv, 375p 24cm. 3454 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. "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 Mathematics General principles of mathematics Graph connectivity. Graph algorithms. Mathematics -- General. Algorithmische Geometrie Graphentheorie Nagamochi, Hiroshi Ibaraki, Toshihide BOOK 59091 59091 0 0 ddc 0 1 SNUL SNUL 2022-04-08 Zafaa Books & Distributors 3454.00 511.5 NAG 28595 2022-04-08 00:00:00 2022-04-08 BOOK Books Shifted in Mathematics Dept.