Librería:
Phatpocket Limited, Waltham Abbey, HERTS, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Vendedor de AbeBooks desde 28 de abril de 2005
Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. N° de ref. del artículo Z1-C-048-02272
An introduction to pure and applied graph theory with an emphasis on algorithms and their complexity.
Críticas:
'... 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
Título: Algorithmic Graph Theory
Editorial: Cambridge University Press
Año de publicación: 1985
Encuadernación: Encuadernación de tapa dura
Condición: Good
Librería: HPB-Red, Dallas, TX, Estados Unidos de America
Paperback. Condición: 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! Nº de ref. del artículo: S_425783091
Cantidad disponible: 1 disponibles
Librería: Anybook.com, Lincoln, Reino Unido
Condición: 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. Nº de ref. del artículo: 5759671
Cantidad disponible: 1 disponibles
Librería: Goodwill Books, Hillsboro, OR, Estados Unidos de America
Condición: acceptable. Fairly worn, but readable and intact. If applicable: Dust jacket, disc or access code may not be included. Nº de ref. del artículo: 3IIT5G0054PZ_ns
Cantidad disponible: 1 disponibles
Librería: Better World Books, Mishawaka, IN, Estados Unidos de America
Condición: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Nº de ref. del artículo: GRP76416647
Cantidad disponible: 1 disponibles
Librería: Better World Books, Mishawaka, IN, Estados Unidos de America
Condición: Good. Used book that is in clean, average condition without any missing pages. Nº de ref. del artículo: 4856032-6
Cantidad disponible: 1 disponibles
Librería: Better World Books, Mishawaka, IN, Estados Unidos de America
Condición: Very Good. Used book that is in excellent condition. May show signs of wear or have minor defects. Nº de ref. del artículo: 42520646-75
Cantidad disponible: 1 disponibles
Librería: WorldofBooks, Goring-By-Sea, WS, Reino Unido
Paperback. Condición: Very Good. 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. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged. Nº de ref. del artículo: GOR002780333
Cantidad disponible: 1 disponibles
Librería: Antiquariat Smock, Freiburg, Alemania
Condición: 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]. Nº de ref. del artículo: 74077
Cantidad disponible: 1 disponibles
Librería: Antiquariat Armebooks, Frankfurt am Main, Alemania
Taschenbuch. Condición: 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. Nº de ref. del artículo: 137895
Cantidad disponible: 1 disponibles
Librería: J. Wyatt Books, Ottawa, ON, Canada
Soft cover. Condición: 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. Nº de ref. del artículo: 219860
Cantidad disponible: 1 disponibles