- We will send in 10–14 business days.
/images/books/3632710/9780521288811.jpg)
- Author: Alan Gibbons
- Publisher: Cambridge University Press
- ISBN-10: 0521288819
- ISBN-13: 9780521288811
- Format: 15.5 x 23.1 x 1.8 cm, minkšti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
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.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 22d.20:42:22
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Alan Gibbons
- Publisher: Cambridge University Press
- ISBN-10: 0521288819
- ISBN-13: 9780521288811
- Format: 15.5 x 23.1 x 1.8 cm, minkšti viršeliai
- Language: English 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.
Reviews