Algorithmic Graph Theory - Rilegato

Gibbons, Alan

Rilegato

ISBN 10: 0521246598 ISBN 13: 9780521246590

Casa editrice: Cambridge University Press, 1985

Riassunto

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

Su questo libro

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.

Dettagli dell?edizione

• Editore: Cambridge University Press
• Data di pubblicazione: 1985
• Lingua: Inglese
• ISBN 10: 0521246598
• ISBN 13: 9780521246590
• Rilegatura: Copertina rigida
• Numero edizione: 1
• Numero di pagine: 271
• Contatto del produttore: non disponibile
• Persona responsabile: Avery; https://www.avery.fr/; ; chemin des peupliers 27; Dardilly; Francia