Nagamochi, Hiroshi  <br/><br/>
Algorithmic aspects of graph connectivity, Vol. 123 

 - Cambridge:  Cambridge University Press,  2008. 
 - xv; 375 p.  pb;  24 cm. 
 - Encyclopedia of mathematics and its applications .
<br/><br/> 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. 
<br/><br/><label>ISBN: </label>9781108735490 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Graph Connectivity<br/>Graph Algorithms<br/>Graph Algorithms<br/>Graph<br/>Mathematics
<br/><br/><label>Dewey Class. No.: </label>511.5 NAG