Algorithmic Aspects Of Graph Connectivity (encyclopedia Of Mathematics And Its Applications)
by Toshihide Ibaraki /
2008 / English / PDF
4 MB Download
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.
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.
