Algorithmic Graph Theory (Paperback)

Descripción

Paperback. 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. An introduction to pure and applied graph theory with an emphasis on algorithms and their complexity. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de ref. del artículo 9780521288811

Contactar al vendedor

Denunciar este artículo

Detalles bibliográficos

Acerca de