Algorithmic Aspects of Graph Connectivity by Hiroshi NagamochiAlgorithmic Aspects of Graph Connectivity by Hiroshi Nagamochi

Algorithmic Aspects of Graph Connectivity

byHiroshi Nagamochi, Toshihide Ibaraki

Hardcover | September 8, 2008

Pricing and Purchase Info


Earn 697 plum® points

In stock online

Ships free on orders over $25

Not available in stores


Algorithmic Aspects of Graph Connectivity is the first comprehensive book on this central notion in graph and network theory, emphasizing its algorithmic aspects. Because of its wide applications in the fields of communication, transportation, and production, graph connectivity has made tremendous algorithmic progress under the influence of the theory of complexity and algorithms in modern computer science. The book contains various definitions of connectivity, including edge-connectivity and vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts. The authors comprehensively discuss new concepts and algorithms that allow for quicker and more efficient computing, such as maximum adjacency ordering of vertices. Covering both basic definitions and advanced topics, this book can be used as a textbook in graduate courses in mathematical sciences, such as discrete mathematics, combinatorics, and operations research, and as a reference book for specialists in discrete mathematics and its applications.
Title:Algorithmic Aspects of Graph ConnectivityFormat:HardcoverDimensions:392 pages, 9.21 × 6.14 × 0.87 inPublished:September 8, 2008Publisher:Cambridge University PressLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:0521878640

ISBN - 13:9780521878647


Table of Contents

1. Introduction; 2. MA ordering and forest decompositions; 3. Minimum cuts; 4. Cut enumeration; 5. Cactus representations; 6. Extreme vertex sets; 7. Edge-splitting; 8. Connectivity augmentation; 9. Source location problems; 10. Submodular and posi-modular set functions.

Editorial Reviews

"This fine graduate-level textbook discusses the algorithmic efficiency of graph connectivity problems. What is impressive about this book is the unified framework in which algorithmic efficiency is discussed."
Mukkai S. Krishnamoorthy, Mathematical Reviews