Sinossi
An introduction to pure and applied graph theory with an emphasis on algorithms and their complexity.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Recensione
'... 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
Descrizione del libro
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
