Skip to content
Home/ Algorithmic Aspects of Graph Connectivity
Algorithmic Aspects of Graph Connectivity

Algorithmic Aspects of Graph Connectivity

by Nagamochi, Hiroshi
No customer reviews yet ISBN 9781108735490

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.

About the author

Product details

Pub dateMay 16, 2019
ISBN-101108735495
ISBN-139781108735490
LanguageEnglish
Last updated 2026-03-23 19:33
$62.16 $63.00 1% off
You save $0.84 · list price $63.00
In stock — ships in 24 hours with free tracking
Delivery by Monday, September 14, 2026
Qty
Sign in to Add to Saved list
Free delivery on orders over $35.
15-day returns. Any reason.
Secure checkout. We never store card details.

Readers who bought this also bought

More from Mathematics | Graphic Methods
See all
Fixed Point Theory and Graph Theory: Foundations and Integrative Approaches
<i> <p>Fixed Point Theory and Graph Theory</i> provides an intersection between the theories of fixed point theorems that give the conditions under which maps (single or multivalued) have solutions and graph theory which uses mathematical structures to illustrate the relationship between ordered pairs of objects in terms of their vertices and directed edges. </p> <p>This edited reference work is perhaps the first to provide a link between the two theories, describing not only their foundational aspects, but also the most recent advances and the fascinating intersection of the domains. </p> <p>The authors provide solution methods for fixed points in different settings, with two chapters devoted to the solutions method for critically important non-linear problems in engineering, namely, variational inequalities, fixed point, split feasibility, and hierarchical variational inequality problems. The last two chapters are devoted to integrating fixed point theory in spaces with the graph and the use of retractions in the fixed point theory for ordered sets.</p>
$115.75
Fast Parallel Algorithms for Graph Matching Problems
Karpinski, Marek
$219.75
Random Geometric Graphs
Penrose, Mathew
$219.75
Graphs, Colourings and the Four-Colour Theorem
Wilson, Robert A
$214.27
Graphs, Colourings and the Four-Colour Theorem
Wilson, Robert A
$110.03
Graph Decompositions: A Study in Infinite Graph Theory
Diestel, Reinhard
$100.15