Order Total (1 Item Items):
Shipping Destination:
Algorithmic Graph Theory by Gibbons Alan (27 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (27)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (16)
- As New, Fine or Near Fine (No further results match this refinement)
- Very Good or Good (10)
- Fair or Poor (1)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (3)
- Not Print on Demand (22)
Language (2)
Free Shipping
Seller Location
Seller Rating
-
Algorithmic Graph Theory
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Language: English
Condition: Very Good. Used book that is in excellent condition. May show signs of wear or have minor defects.
-
Algorithmic Graph Theory
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Language: English
Condition: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.
-
Algorithmic Graph Theory
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Language: English
Paperback. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
-
Algorithmic Graph Theory
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Language: English
Condition: Good. Used book that is in clean, average condition without any missing pages.
-
Algorithmic Graph Theory
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Language: English
Condition: Acceptable. Fairly worn, but readable and intact. If applicable: Dust jacket, disc or access code may not be included.
-
Algorithmic Graph Theory
Published by Cambridge University Press, 1985
ISBN 10: 0521246598 ISBN 13: 9780521246590
Language: English
Hardcover. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 1.15.
-
Algorithmic Graph Theory
Published by Cambridge University Press, 1985
ISBN 10: 0521246598 ISBN 13: 9780521246590
Language: English
Seller: WorldofBooks, Goring-By-Sea, WS, United Kingdom
Seller rating 5 out of 5 stars
US$ 12.88
Convert currencyUS$ 7.55 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketHardback. Condition: Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.
-
Algorithmic Graph Theory
Published by Cambridge University Press, 1994
ISBN 10: 0521288819 ISBN 13: 9780521288811
Language: English
US$ 6.94
Convert currencyUS$ 17.44 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketCondition: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,500grams, ISBN:9780521288811.
-
Algorithmic Graph Theory.
Published by Cambridge, Cambridge University Press, 1988
ISBN 10: 0521288819 ISBN 13: 9780521288811
Language: English
US$ 28.77
Convert currencyUS$ 15.01 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketCondition: Gut. Formateinband: Broschierte Ausgabe XII, 259 S. (23 cm) Reprinted; Gut und sauber erhalten. Sprache: Englisch Gewicht in Gramm: 550 [Stichwörter: Algorithmische Graphentheorie; Spanning-trees, branchings and connectivity; Planar graphs; Networks and flows; Matchings; Eulerian and Hamiltonian tours; Colouring graphs; Graph problems and intractability].
-
Algorithmic Graph Theory
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Language: English
Seller: Antiquariat Armebooks, Frankfurt am Main, Germany
Seller rating 5 out of 5 stars
US$ 30.22
Convert currencyUS$ 23.28 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketTaschenbuch. 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.
-
Algorithmic Graph Theory
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Language: English
US$ 67.14
Convert currencyUS$ 3.99 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Algorithmic Graph Theory
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Language: English
Condition: New.
-
Algorithmic Graph Theory
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Language: English
Paperback. Condition: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks.
-
Algorithmic Graph Theory
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Language: English
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 65.43
Convert currencyUS$ 16.15 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Algorithmic Graph Theory (Paperback)
Published by Cambridge University Press, Cambridge, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Language: English
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. An introduction to pure and applied graph theory with an emphasis on algorithms and their complexity. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
Algorithmic Graph Theory
Published by Cambridge University Press 1985-06-27, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Language: English
US$ 63.41
Convert currencyUS$ 20.88 shipping from United Kingdom to U.S.A.Quantity: 10 available
Add to basketPaperback. Condition: New.
-
Algorithmic Graph Theory
Published by Cambridge University Press CUP, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Language: English
Condition: New. pp. 272 Indices.
-
Algorithmic Graph Theory
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Language: English
paperback. Condition: New. In shrink wrap. Looks like an interesting title!
-
Algorithmic Graph Theory (Paperback)
Published by Cambridge University Press, Cambridge, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Language: English
US$ 72.86
Convert currencyUS$ 49.87 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. 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. An introduction to pure and applied graph theory with an emphasis on algorithms and their complexity. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
-
Algorithmic Graph Theory (Paperback)
Published by Cambridge University Press, Cambridge, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Language: English
US$ 93.75
Convert currencyUS$ 37.00 shipping from Australia to U.S.A.Quantity: 1 available
Add to basketPaperback. 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. An introduction to pure and applied graph theory with an emphasis on algorithms and their complexity. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
-
Algorithmic Graph Theory
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Language: English
US$ 108.69
Convert currencyUS$ 72.42 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketTaschenbuch. 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.
-
Algorithmic Graph Theory
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Language: English
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
US$ 67.15
Convert currencyUS$ 14.89 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPaperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 430.
-
Algorithmic Graph Theory
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Language: English
US$ 85.47
Convert currencyUS$ 8.76 shipping from United Kingdom to U.S.A.Quantity: 4 available
Add to basketCondition: New. Print on Demand pp. 272 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam.
-
US$ 65.08
Convert currencyUS$ 33.69 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: Brand New. 271 pages. 9.25x6.25x0.75 inches. In Stock. This item is printed on demand.
-
Algorithmic Graph Theory
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Language: English
US$ 93.58
Convert currencyUS$ 11.58 shipping from Germany to U.S.A.Quantity: 4 available
Add to basketCondition: New. PRINT ON DEMAND pp. 272.
-
US$ 40.25
Convert currencyUS$ 23.00 shipping from Canada to U.S.A.Quantity: 1 available
Add to basketSoft 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.
-
Algorithmic Graph Theory
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Language: English
US$ 73.15
Convert currencyUS$ 57.01 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketCondition: 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.
