Skip to content

Algorithmic Aspects of Graph Connectivity

Spend $50 to get a free movie!

ISBN-10: 0521878640

ISBN-13: 9780521878647

Edition: 2008

Authors: Hiroshi Nagamochi, Toshihide Ibaraki

List price: $102.99
Blue ribbon 30 day, 100% satisfaction guarantee!
Out of stock
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Description:

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…    
Customers also bought

Book details

List price: $102.99
Copyright year: 2008
Publisher: Cambridge University Press
Publication date: 9/8/2008
Binding: Hardcover
Pages: 392
Size: 6.50" wide x 9.50" long x 1.25" tall
Weight: 1.540
Language: English

Hiroshi Nagamochi is a professor at the Graduate School of Informatics, Kyoto University. He is a member of the Operations Research Society of Japan and the Information Processing Society.

Introduction
MA ordering and forest decompositions
Minimum cuts
Cut enumeration
Cactus representations
Extreme vertex sets
Edge-splitting
Connectivity augmentation
Source location problems
Submodular and posi-modular set functions