Lingua: Inglese
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Da: MusicMagpie, Stockport, Regno Unito
EUR 8,23
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Very Good. 1770908915. 2/12/2026 3:08:35 PM.
Lingua: Inglese
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Da: HPB-Red, Dallas, TX, U.S.A.
Paperback. Condizione: 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!
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Da: Literary Cat Books, Machynlleth, Powys, WALES, Regno Unito
Membro dell'associazione: IOBA
Prima edizione
EUR 11,75
Quantità: 1 disponibili
Aggiungi al carrelloOriginal decorated wrappers. Condizione: Very Good. 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.
Lingua: Inglese
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Da: Textbooks_Source, Columbia, MO, U.S.A.
Prima edizione
paperback. Condizione: 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).
Lingua: Inglese
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Da: Antiquariat Armebooks, Frankfurt am Main, Germania
EUR 25,21
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Lingua: Inglese
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Da: GoldBooks, Denver, CO, U.S.A.
Condizione: new.
Lingua: Inglese
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Da: California Books, Miami, FL, U.S.A.
EUR 66,25
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 55,59
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Lingua: Inglese
Editore: Cambridge University Press 1985-06-27, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Da: Chiron Media, Wallingford, Regno Unito
EUR 53,67
Quantità: 10 disponibili
Aggiungi al carrelloPaperback. Condizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Da: BennettBooksLtd, Los Angeles, CA, U.S.A.
paperback. Condizione: New. In shrink wrap. Looks like an interesting title!
Editore: Cambridge University Press, Cambridge, 1985
Da: J. Wyatt Books, Ottawa, ON, Canada
EUR 35,09
Quantità: 1 disponibili
Aggiungi al carrelloSoft cover. Condizione: 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.
Lingua: Inglese
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 88,17
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Da: Revaluation Books, Exeter, Regno Unito
EUR 55,09
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 271 pages. 9.25x6.25x0.75 inches. In Stock. This item is printed on demand.
Lingua: Inglese
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 57,29
Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condizione: 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. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Da: CitiRetail, Stevenage, Regno Unito
EUR 62,85
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Lingua: Inglese
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Da: moluna, Greven, Germania
EUR 61,02
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: 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.
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Da: AussieBookSeller, Truganina, VIC, Australia
EUR 91,91
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: 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. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Lingua: Inglese
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Da: preigu, Osnabrück, Germania
EUR 75,15
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Algorithmic Graph Theory | Alan Gibbons | Taschenbuch | Kartoniert / Broschiert | Englisch | 1985 | Cambridge University Press | EAN 9780521288811 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.