Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Algorithmic Graph Theory, Hardback Book

Algorithmic Graph Theory Hardback

Hardback

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.

Information

Other Formats

Save 7%

£35.00

£32.49

Item not Available
 
Free Home Delivery

on all orders

 
Pick up orders

from local bookshops

Information