
Algorithmic aspects of graph connectivity
"Algorithmic Aspects of Graph Connectivity is the first book that thoroughly discusses graph connectivity, a central notion in graph and network theory, emphasizing its algorithmic aspects. This book contains various definitions of connectivity, including edge-connectivity, vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts." "Covering both basic definitions and advanced topics, this book can be used as a textbook in graduate courses of mathematical sciences (such as discrete mathematics, combinatorics, and operations research) in addition to being an important reference book for all specialists working in discrete mathematics and its applications."--Jacket.
- Generi
- Graph algorithms, Graph connectivity, Algorithms, Graphic methods
- Autore
- Hiroshi Nagamochi
- Pagine
- 375
Dove trovarlo
Alcuni collegamenti sono di affiliazione: se acquisti, il sito può ricevere una commissione, senza costi in più per te.
Non sai cosa scegliere?
Dimmi i tuoi gusti e ti propongo cosa leggere, in base a quello che ti piace.
Provalo gratisTitoli simili
Graphs, algorithms, and optimization (2004)
Algorithms in C++ (1990)
Combinatorial Pattern Matching Algorithms in Computational Biology using Perl and R (2009)
Graph algorithms (1979)
Algorithms and complexity (2003)
Planar graph drawing (2004)
Graph algorithms and applications I (2002)
Distributed Graph Algorithms for Computer Networks (2013)