000			01390 a2200241 4500
999			_c52640 _d52640
008			200320b ||||| |||| 00| 0 eng d
020			_a9781108735490
082			_a511.5 NAG
100			_aNagamochi, Hiroshi
245			_aAlgorithmic aspects of graph connectivity, Vol. 123
260			_bCambridge University Press, _c2008. _aCambridge:
300			_axv; 375 p. _bpb; _c24 cm.
365			_aGBP _b32.99
440			_aEncyclopedia of mathematics and its applications
520			_aAlgorithmic 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.
650			_aGraph Connectivity
650			_aGraph Algorithms
650			_aGraph Algorithms
650			_aGraph
650			_aMathematics
700			_aIbaraki, Toshihide
942			_2ddc _cTD