Algorithmic graph theory / Alan Gibbons.
Material type:
TextPublisher: Cambridge : The press Syndicate of the university of Cambridge, [1994]Copyright date: © Cambridge university press 1985Description: 259 pages : illustrations ; 20 cmContent type: text Media type: unmediated Carrier type: volumeISBN: 9780521288811Subject(s): Graph theory | Graph theory -- Data processingDDC classification: 511.5 Summary: This is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colorability, 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. Everyday 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."
| Item type | Current location | Call number | Materials specified | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
NB-Book
|
Uofcanada Library | 511.5 ALA/NB (Browse shelf) | Not for loan | 00000803 | |||
|
Book
|
Uofcanada Library | 511.5 ALA (Browse shelf) | Available | 00000804 | |||
|
Book
|
Uofcanada Library | 511.5 ALA (Browse shelf) | Available | 00000805 |
Browsing Uofcanada Library shelves Close shelf browser
Includes index.
This is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colorability, 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. Everyday 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."
There are no comments on this title.