You might also like

More about Algorithmic Graph Theory

• Book details
• Synopsis
• Trending among others

You get 171 loyalty points

Book synopsis

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.

Book details

Book category Books in English Mathematics & science Mathematics Combinatorics & graph theory

• Full title: Algorithmic Graph Theory
• Author: Alan Gibbons
• Language: English
• Binding: Paperback
• Number of pages: 272
• EAN: 9780521288811
• ISBN: 0521288819
• ID: 02026690
• Publisher: Cambridge University Press
• Weight: 442 g
• Dimensions: 153 × 230 × 10 mm
• Date of publishing: 27. June 1985

Trending among others

---

---

---