An introduction to pure and applied graph theory with an emphasis on algorithms and their complexity.
"synopsis" may belong to another edition of this title.
'... the book covers a relatively large part of algorithmic graph theory. The theory presented is well motivated. I can conclude that the textbook is well written and for those interested in learning algorithmic graph theory, this is s good introduction.' Zentralblatt für Mathematik und ihre Grenzgebiete
'... this is a stimulating book for those who want to learn some basic algorithms of graph theory and who already know where to apply them ... nice and thorough introduction.' European Journal of Operational Research
'Alan Gibbons' book ... succeeds admirably.' The Times Higher Education Supplement
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 ñ which graph problems have known efficient solutions and which are intractable.
"About this title" may belong to another edition of this title.
£ 4.48 shipping within United Kingdom
Destination, rates & speedsSeller: Anybook.com, Lincoln, United Kingdom
Condition: 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. Seller Inventory # 5759671
Quantity: 1 available
Seller: Better World Books, Mishawaka, IN, U.S.A.
Condition: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Seller Inventory # GRP76416647
Quantity: 1 available
Seller: Better World Books, Mishawaka, IN, U.S.A.
Condition: Very Good. Used book that is in excellent condition. May show signs of wear or have minor defects. Seller Inventory # 42520646-75
Quantity: 1 available
Seller: Antiquariat Smock, Freiburg, Germany
Condition: Gut. Formateinband: Broschierte Ausgabe XII, 259 S. (23 cm) Reprinted; Gut und sauber erhalten. // VERSAND ERST WIEDER AB DEM 22.08.2025 // SHIPMENT AFTER AUGUST 22. // 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]. Seller Inventory # 74077
Quantity: 1 available
Seller: Antiquariat Armebooks, Frankfurt am Main, Germany
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. Seller Inventory # 137895
Quantity: 1 available
Seller: Chiron Media, Wallingford, United Kingdom
Paperback. Condition: New. Seller Inventory # 6666-IUK-9780521288811
Quantity: 10 available
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 430. Seller Inventory # C9780521288811
Quantity: Over 20 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9780521288811_new
Quantity: Over 20 available
Seller: CitiRetail, Stevenage, United Kingdom
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 our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9780521288811
Quantity: 1 available
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 271 pages. 9.25x6.25x0.75 inches. In Stock. This item is printed on demand. Seller Inventory # __0521288819
Quantity: 1 available