Verkäufer
WorldofBooks, Goring-By-Sea, WS, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
AbeBooks-Verkäufer seit 16. März 2007
The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged. Bestandsnummer des Verkäufers GOR008059551
An introduction to pure and applied graph theory with an emphasis on algorithms and their complexity.
Titel: Algorithmic Graph Theory
Verlag: Cambridge University Press
Erscheinungsdatum: 1985
Einband: Hardback
Zustand: Very Good
Anbieter: Better World Books, Mishawaka, IN, USA
Zustand: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Artikel-Nr. GRP76416647
Anzahl: 1 verfügbar
Anbieter: Better World Books, Mishawaka, IN, USA
Zustand: Good. Used book that is in clean, average condition without any missing pages. Artikel-Nr. 4856032-6
Anzahl: 1 verfügbar
Anbieter: Antiquariat Armebooks, Frankfurt am Main, Deutschland
Taschenbuch. Zustand: Gut. 272 Seiten Cambridge University Press 1988 : Alan Gibbons - Perfect tb - Namenseitrag - 9-81-4-L1 N9-IYL3-2BD3 Sprache: Englisch Gewicht in Gramm: 476. Artikel-Nr. 137895
Anzahl: 1 verfügbar
Anbieter: J. Wyatt Books, Ottawa, ON, Kanada
Soft cover. Zustand: Very Good. 259 pages in very good condition. Pages are clean and unmarked. Page edges are lightly darkened. Black card covers with white and green titles. Lightly worn around the edges. Spine is lightly scratched. VG/- -. Book. Artikel-Nr. 219860
Anzahl: 1 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. 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. Artikel-Nr. 9780521288811
Anzahl: 1 verfügbar