Algorithmic Graph Theory - Softcover

Gibbons, Alan

Softcover

ISBN 10: 0521288819 ISBN 13: 9780521288811

Publisher: Cambridge University Press, 1985

Synopsis

An introduction to pure and applied graph theory with an emphasis on algorithms and their complexity.

About this title

Review

'... the book covers a relatively large part of algorithmic graph theory. The theory presented is well motivated. I can conclude that the textbook is well written and for those interested in learning algorithmic graph theory, this is s good introduction.' Zentralblatt für Mathematik und ihre Grenzgebiete

'... this is a stimulating book for those who want to learn some basic algorithms of graph theory and who already know where to apply them ... nice and thorough introduction.' European Journal of Operational Research

'Alan Gibbons' book ... succeeds admirably.' The Times Higher Education Supplement

Book Description

Algorithm Graph Theory introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colourability, flows in networks, matching and transversals) and covers many of the classical theorems. Its emphasis is on algorithms and their complexity ñ which graph problems have known efficient solutions and which are intractable.

Edition details

• Publisher: Cambridge University Press
• Publication date: 1985
• Language: English
• ISBN 10: 0521288819
• ISBN 13: 9780521288811
• Binding: Paperback
• Number of pages: 272