Algorithmic Aspects of Graph Connectivity
$100.00 ( ) USD
- Hiroshi Nagamochi, Kyoto University, Japan
- Toshihide Ibaraki, Kwansei Gakuin University, Japan
Adobe eBook Reader
Other available formats:
Looking for an examination copy?
If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact firstname.lastname@example.org providing details of the course you are teaching.
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.Read more
- Starts from basic materials of graph theory
- Up-to-date topics and algorithms in the area of graph connectivity
- Covers new concepts and algorithms for quicker and more efficient computing
Reviews & endorsements
"... A comprehensive graduate level text and a worth addition to a professional library."
Book NewsSee more 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
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: April 2011
- format: Adobe eBook Reader
- isbn: 9780511839139
- contains: 1 table
- availability: This item is not supplied by Cambridge University Press in your region. Please contact eBooks.com for availability.
Table of Contents
2. MA ordering and forest decompositions
3. Minimum cuts
4. Cut enumeration
5. Cactus representations
6. Extreme vertex sets
8. Connectivity augmentation
9. Source location problems
10. Submodular and posi-modular set functions.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email email@example.comRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×