Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Books
  3. Algorithmic Aspects of Graph Connectivity
  • Cited by 63
Publisher:
Cambridge University Press
Online publication date:
May 2010
Print publication year:
2008
Online ISBN:
9780511721649
DOI:
https://doi.org/10.1017/CBO9780511721649
Subjects:
Mathematics (general), Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science, Optimization, OR and risk, Statistics and Probability
Series:
Encyclopedia of Mathematics and its Applications (123)
Information

Book 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 thoroughly 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.

Reviews

'… a comprehensive graduate level text and a worthy addition to a professional library.'

Source: SciTech Book News

'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.'

Source: Mathematical Reviews

'This excellent book can be an important source for researchers and a valuable textbook for graduate students.'

Source: Zentralblatt MATH

'… comprehensive and detailed …'

Source: EMS Newsletter

Refine List

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

Contents

Contents

Metrics

Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Book summary page views

Total views: 0 *
Loading metrics...

* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

Usage data cannot currently be displayed.