Zustand: Good. Good condition. A copy that has been read but remains intact. May contain markings such as bookplates, stamps, limited notes and highlighting, or a few light stains.
Zustand: Very Good. Very Good condition. A copy that may have a few cosmetic defects. May also contain light spine creasing or a few markings such as an owner's name, short gifter's inscription or light stamp.
Anbieter: ThriftBooks-Atlanta, AUSTELL, GA, USA
Hardcover. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
Anbieter: ThriftBooks-Dallas, Dallas, TX, USA
Hardcover. Zustand: Very Good. No Jacket. Missing dust jacket; May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
Anbieter: ThriftBooks-Atlanta, AUSTELL, GA, USA
Hardcover. Zustand: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.
Anbieter: ThriftBooks-Dallas, Dallas, TX, USA
Hardcover. Zustand: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.
Sprache: Englisch
Verlag: Cambridge University Press, 2011
ISBN 10: 0521736536 ISBN 13: 9780521736534
Anbieter: Better World Books Ltd, Dunfermline, Vereinigtes Königreich
EUR 35,78
Anzahl: 1 verfügbar
In den WarenkorbZustand: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.
Sprache: Englisch
Verlag: Cambridge University Press, New York, 2012
ISBN 10: 0521736536 ISBN 13: 9780521736534
Anbieter: PsychoBabel & Skoob Books, Didcot, Vereinigtes Königreich
EUR 30,97
Anzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: Very Good. Paperback in very good condition. Light shelf wear only. Covers are clean, binding is sound and pages are clear. LW. Used.
Sprache: Englisch
Verlag: Cambridge University Press, 2011
ISBN 10: 0521736536 ISBN 13: 9780521736534
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 49,19
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Sprache: Englisch
Verlag: Cambridge University Press, 2011
ISBN 10: 0521736536 ISBN 13: 9780521736534
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: New. This thoroughly revised second edition of Shimon Even's Graph Algorithms explains algorithms directly and intuitively, in formal but simple language. Editor(s): Even, Guy. Num Pages: 202 pages, 64 b/w illus. 10 tables. BIC Classification: UMB. Category: (U) Tertiary Education (US: College). Dimension: 228 x 159 x 13. Weight in Grams: 298. . 2011. 2nd Edition. paperback. . . . . Books ship from the US and Ireland.
EUR 65,76
Anzahl: 2 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. 2nd edition. 208 pages. 9.00x6.00x0.50 inches. In Stock.
Sprache: Englisch
Verlag: Cambridge University Press, 2011
ISBN 10: 0521517184 ISBN 13: 9780521517188
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 107,26
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Sprache: Englisch
Verlag: Cambridge University Press, 2011
ISBN 10: 0521736536 ISBN 13: 9780521736534
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition and explains algorithms in a formal but simple language with a direct and intuitive presentation. The book begins by covering basic material, including graphs and shortest paths, trees, depth-first-search and breadth-first search. The main part of the book is devoted to network flows and applications of network flows, and it ends with chapters on planar graphs and testing graph planarity. Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory textbook. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition, explaining algorithms in formal but simple language with a direct and intuitive presentation.
Sprache: Englisch
Verlag: Cambridge University Press, 2011
ISBN 10: 0521517184 ISBN 13: 9780521517188
Anbieter: Studibuch, Stuttgart, Deutschland
hardcover. Zustand: Gut. 208 Seiten; 9780521517188.3 Gewicht in Gramm: 500.
Sprache: Englisch
Verlag: Cambridge University Press, 2011
ISBN 10: 0521517184 ISBN 13: 9780521517188
Anbieter: Kennys Bookstore, Olney, MD, USA
EUR 150,27
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. This thoroughly revised second edition of Shimon Even's Graph Algorithms explains algorithms directly and intuitively, in formal but simple language. Editor(s): Even, Guy. Num Pages: 202 pages, 64 b/w illus. 10 tables. BIC Classification: UMB. Category: (P) Professional & Vocational. Dimension: 228 x 152 x 16. Weight in Grams: 410. . 2011. 2nd Edition. hardcover. . . . . Books ship from the US and Ireland.
EUR 150,67
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 2nd edition. 189 pages. 9.25x6.25x0.50 inches. In Stock.
Sprache: Englisch
Verlag: Cambridge University Press, 2011
ISBN 10: 0521517184 ISBN 13: 9780521517188
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition and explains algorithms in a formal but simple language with a direct and intuitive presentation. The book begins by covering basic material, including graphs and shortest paths, trees, depth-first-search and breadth-first search. The main part of the book is devoted to network flows and applications of network flows, and it ends with chapters on planar graphs and testing graph planarity.