An introduction to pure and applied graph theory with an emphasis on algorithms and their complexity.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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: Majestic Books, Hounslow, Vereinigtes Königreich
Zustand: New. pp. 272 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam. Artikel-Nr. 7467277
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