Share
Algorithmic Graph Theory (in English)
Alan Gibbons
(Author)
·
Cambridge University Press
· Paperback
Algorithmic Graph Theory (in English) - Gibbons, Alan
$ 55.46
$ 61.99
You save: $ 6.53
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
Tuesday, May 14 and
Wednesday, May 15.
You will receive it anywhere in United States between 1 and 3 business days after shipment.
Synopsis "Algorithmic Graph Theory (in English)"
This is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with an interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colourability, flows in networks, matchings and traversals) and covers many of the major classical theorems, the emphasis is on algorithms and thier complexity: which graph problems have known efficient solutions and which are intractable. For the intractable problems a number of efficient approximation algorithms are included with known performance bounds. Informal use is made of a PASCAL-like programming language to describe the algorithms. A number of exercises and outlines of solutions are included to extend and motivate the material of the text.
- 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.
