Algorithmic Graph Theory

Alan Gibbons

ISBN 10: 0521288819 / ISBN 13: 9780521288811

Published by Cambridge University Press, 1985

About this Item

Druck auf Anfrage Neuware - Printed after ordering - 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 their 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.

Seller Inventory # 9780521288811

Bibliographic Details

• Title: Algorithmic Graph Theory
• Publisher: Cambridge University Press
• Publication Date: 1985
• Language: English
• ISBN 10: 0521288819
• ISBN 13: 9780521288811
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 229W x 152H x 17D millimeters 229 millimeters width by 152 millimeters height by 17 millimeters depth
• Weight: 446 grams

About this title

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 Description

This introduction to most of the classical concepts of pure and applied graph theory covers many of the major classical theorems. The emphasis is on algorithms and their complexity--what graph problems have known efficient solutions and which are intractable.