Share
Algorithmic Aspects of Graph Connectivity (Encyclopedia of Mathematics and its Applications) (in English)
Hiroshi Nagamochi (Author)
·
Cambridge University Press
· Paperback
Algorithmic Aspects of Graph Connectivity (Encyclopedia of Mathematics and its Applications) (in English) - Hiroshi Nagamochi
$ 50.99
$ 56.99
You save: $ 6.00
Choose the list to add your product or create one New List
✓ Product added successfully to the Wishlist.
Go to My WishlistsIt will be shipped from our warehouse between
Friday, May 10 and
Monday, May 13.
You will receive it anywhere in United States between 1 and 3 business days after shipment.
Synopsis "Algorithmic Aspects of Graph Connectivity (Encyclopedia of Mathematics and its Applications) (in 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.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.
✓ Producto agregado correctamente al carro, Ir a Pagar.
