Algorithmic Graph Theory by Gibbons Alan (27 results)

Paperback. Condition: 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.

Condition: acceptable. Book is considered to be in acceptable condition. The actual cover image may not match the stock photo. Book may have one or more of the following defects: noticeable wear on the cover dust jacket or spine; curved, dog eared or creased page s ; writing or highlighting inside or on the edges; sticker s or other adhesive on cover; CD DVD may not be included; and book may be a former library copy.…

paperback. Condition: 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.…

Condition: 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. Condition: 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.

Original decorated wrappers. Condition: Very Good. No Dust Jacket. First Paperback Edition. With diagrams. Former owner's name on front free endpaper. Pages yellowed as normal for age. Spine uncreased. Slight wear to spine, covers & corners.; Large 8vo 9" - 10" tall; xii, 259 pages.

paperback. Condition: Good. 1st Edition. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).

Taschenbuch. Condition: 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.

Condition: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.…

Paperback. Condition: new. New Copy. Customer Service Guaranteed.

Paperback. Condition: New. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Condition: New. pp. 272 Indices.

Paperback. Condition: New. 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. …

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

Condition: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.…

Condition: New. pp. 272.

paperback. Condition: New. In shrink wrap. Looks like an interesting title.

Condition: New. In English.

Soft cover. Condition: 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.

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

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

Paperback. Condition: New. 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. …

Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Paperback. Condition: new. Paperback. 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. 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 n which graph problems have known efficient solutions and which are intractable. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 o.…