Coverart for item
The Resource Algorithmic graph theory, Alan Gibbons

Algorithmic graph theory, Alan Gibbons

Label
Algorithmic graph theory
Title
Algorithmic graph theory
Statement of responsibility
Alan Gibbons
Creator
Subject
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
http://library.link/vocab/creatorName
Gibbons, Alan
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
http://library.link/vocab/subjectName
  • Graph theory
  • Graph theory
  • Graphes, Théorie des
  • Graphes, Théorie des
Label
Algorithmic graph theory, Alan Gibbons
Instantiates
Publication
Note
Includes indexes
Bibliography note
Includes bibliographical references
Carrier category
volume
Carrier category code
  • nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
1. Introducing graphs and algorithmic complexity -- 2. Spanning-trees, branchings and connectivity -- 3. Planar graphs -- 4. Networks and flows -- 5. Matchings -- 6. Eulerian and Hamiltonian tours -- 7. Colouring graphs -- 8. Graph problems and intractability
Control code
11316168
Dimensions
24 cm
Extent
xii, 259 pages
Isbn
9780521288811
Isbn Type
(pbk.)
Lccn
84023835
Media category
unmediated
Media MARC source
rdamedia
Media type code
  • n
Other physical details
illustrations
System control number
(WaOLN)742250
Label
Algorithmic graph theory, Alan Gibbons
Publication
Note
Includes indexes
Bibliography note
Includes bibliographical references
Carrier category
volume
Carrier category code
  • nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
1. Introducing graphs and algorithmic complexity -- 2. Spanning-trees, branchings and connectivity -- 3. Planar graphs -- 4. Networks and flows -- 5. Matchings -- 6. Eulerian and Hamiltonian tours -- 7. Colouring graphs -- 8. Graph problems and intractability
Control code
11316168
Dimensions
24 cm
Extent
xii, 259 pages
Isbn
9780521288811
Isbn Type
(pbk.)
Lccn
84023835
Media category
unmediated
Media MARC source
rdamedia
Media type code
  • n
Other physical details
illustrations
System control number
(WaOLN)742250

Library Locations

    • Mathematical Sciences LibraryBorrow it
      104 Ellis Library, Columbia, MO, 65201, US
      38.944377 -92.326537
Processing Feedback ...