Algorithmic Graph Theory
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 their 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. In…
Mehr
CHF 77.00
Preise inkl. MwSt. und Versandkosten (Portofrei ab CHF 40.00)
V103:
Folgt in ca. 5 Arbeitstagen
Produktdetails
- ISBN: 978-0-521-28881-1
- EAN: 9780521288811
- Produktnummer: 9777570
- Verlag: Cambridge University Press
- Sprache: Englisch
- Erscheinungsjahr: 1985
- Seitenangabe: 272 S.
- Masse: H22.9 cm x B15.2 cm x D1.6 cm 423 g
- Abbildungen: Paperback
- Gewicht: 423
98 weitere Werke von Alan Gibbons:
Bewertungen
Anmelden