Verwandte Artikel zu Algorithmic Graph Theory
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Críticas
'... 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
Reseña del editor
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
- VerlagCambridge University Press
- Erscheinungsdatum1985
- ISBN 10 0521246598
- ISBN 13 9780521246590
- EinbandTapa dura
- SpracheEnglisch
- Auflage1
- Anzahl der Seiten271
Suchergebnisse für Algorithmic Graph Theory
Beispielbild für diese ISBN
Algorithmic Graph Theory
Verlag:
Cambridge University Press, 1985
ISBN 10: 0521246598
ISBN 13: 9780521246590
Gebraucht
Hardcover
Anbieter: ThriftBooks-Dallas, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 1.15. Artikel-Nr. G0521246598I4N00
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Algorithmic Graph Theory
Verlag:
Cambridge University Press, 1985
ISBN 10: 0521246598
ISBN 13: 9780521246590
Gebraucht
Hardcover
Anbieter: WorldofBooks, Goring-By-Sea, WS, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardback. Zustand: Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged. Artikel-Nr. GOR008059551
Anzahl: 1 verfügbar