Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Algorithmic Aspects of Graph Connectivity

Algorithmic Aspects of Graph Connectivity

Nagamochi, Hiroshi
Ibaraki, Toshihide

Hardcover

Series: Encyclopedia of Mathematics and Its Applications, Book 123

General MathematicsProgramming

ISBN10: 0521878640
ISBN13: 9780521878647
Publisher: Cambridge
Published: Sep 8 2008
Pages: 392
Weight: 1.50
Height: 1.30 Width: 6.30 Depth: 9.20
Language: English
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 different editions

Also available

Also in

General Mathematics

View All