Algorithmic Graph Theory

Ranked #25 in Graph Theory

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... more

Similar Books

If you like Algorithmic Graph Theory, check out these similar top-rated books:


Learn: What makes Shortform summaries the best in the world?