Algorithmic graph theory von gibbons alan (11 Ergebnisse)

Paperback. Zustand: Very Good. 1. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

paperback. Zustand: Good. Most items will be dispatched the same or the next working day. A copy that has been read but remains in clean condition. All of the pages are intact and the cover is intact and the spine may show signs of wear. The book may have minor markings which are not specifically mentioned. Ex library copy with usual stamps & stickers.…

Zustand: Very Good. 259 pp., paperback, a small scratch to the front cover else very good. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.…

Broschiert. Zustand: Gut. 259 Seiten Das hier angebotene Buch stammt aus einer teilaufgelösten Bibliothek und kann die entsprechenden Kennzeichnungen aufweisen (Rückenschild, Instituts-Stempel.); der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 345. …

First Edition. Very good paperback copy; edges slightly creased as with age. Clean internally. Remains well-preserved overall. Physical description; 259 pages : illustrations. Subjects; Graph theory. Algorithms. Graph theory Data processing. Computational complexity. Gibbons, Alan. 1 Kg.

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.

Zustand: New. pp. 272 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam.

Zustand: New. In English.

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.

Zustand: New. An introduction to pure and applied graph theory with an emphasis on algorithms and their complexity. Num Pages: 272 pages, illustrations, indexes. BIC Classification: PBV. Category: (U) Tertiary Education (US: College). Dimension: 153 x 230 x 10. Weight in Grams: 442. . 1985. Illustrated. paperback. . . . . Books ship from the US and Ireland. …

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.…