Algorithmic graph theory

Resource Information

The work Algorithmic graph theory represents a distinct intellectual or artistic creation found in University of Missouri Libraries. This resource is a combination of several types including: Work, Language Material, Books.

Label

Algorithmic graph theory

Statement of responsibility

Alan Gibbons

Creator

• Gibbons, Alan, (Alan M)

Subject

• Graph theory
• Graph theory -- Data processing
• Graph theory | Algorithms.
• Graphes, Théorie des
• Graphes, Théorie des -- Informatique

Language

eng

Summary

"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 cover

Cataloging source

DLC

Dewey number

511/.5

Illustrations

illustrations

Index

index present

LC call number

QA166

LC item number

.G53 1985

Literary form

non fiction

Nature of contents

bibliography