Algorithmic Aspects of Graph Connectivity
1.6 hrs read
Rate this book:
About This Book
"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.
Buy This Book
As an Amazon Associate and Bookshop.org affiliate, BookOrb earns from qualifying purchases.
Write a Review
Sign in to write a review.
More by Toshihide Ibaraki
Adaptive linear classifier by linear programming
An Implicit enumeration program for zero-one integer programming
Arugorizumu to deta kozo (21-seiki o shikoshita denshi tsushin joho karikyuramu shirizu)
Enumerative approaches to comb
Enumerative approaches to combinatorial optimization
Implicit enumeration algorithm of integer programming on Illiac IV
Minimization of switching netw
Minimization of switching networks using negative functions