ShopSpell

Algorithmic Aspects of Graph Connectivity [Hardcover]

$110.99       (Free Shipping)
100 available
  • Category: Books (Mathematics)
  • Author:  Nagamochi, Hiroshi, Ibaraki, Toshihide
  • Author:  Nagamochi, Hiroshi, Ibaraki, Toshihide
  • ISBN-10:  0521878640
  • ISBN-10:  0521878640
  • ISBN-13:  9780521878647
  • ISBN-13:  9780521878647
  • Publisher:  Cambridge University Press
  • Publisher:  Cambridge University Press
  • Pages:  392
  • Pages:  392
  • Binding:  Hardcover
  • Binding:  Hardcover
  • Pub Date:  01-May-2008
  • Pub Date:  01-May-2008
  • SKU:  0521878640-11-MPOD
  • SKU:  0521878640-11-MPOD
  • Item ID: 100714216
  • Seller: ShopSpell
  • Ships in: 2 business days
  • Transit time: Up to 5 business days
  • Delivery by: Dec 26 to Dec 28
  • Notes: Brand New Book. Order Now.
The first really thorough book to discuss this central notion in graph and network theory, emphasizing its algorithmic aspects.Algorithmic Aspects of Graph Connectivity is the first comprehensive book on this central notion in graph and network theory. The authors introduce various definitions of connectivity and their ramifications, related topics such as flows and cuts, and new concepts and algorithms that allow for quicker and more efficient computing.Algorithmic Aspects of Graph Connectivity is the first comprehensive book on this central notion in graph and network theory. The authors introduce various definitions of connectivity and their ramifications, related topics such as flows and cuts, and new concepts and algorithms that allow for quicker and more efficient computing.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.1. Introduction; 2. MA ordering and forest decompositions; 3. Minimum cuts; 4. Cut enumeration; 5. Cactus representations; 6. Extreme vertex sets; 7. Edge-spliló-
Add Review