Handbook of Graph Theory, Combinatorial Optimization, and Algorithms
Now Browsing: Textbooks › Algorithms › Handbook of Graph Theory, Combinatorial Optimization, and…
T. Nishizeki
Guoliang Xue
Published: 12/18/2015
Publisher: CRC Press, Taylor & Francis
Format: Hardcover
Pages: 1226
ISBN 13: 9781584885955
ISBN 10: 1584885955
- All
- Rent
- Buy
- eBook
- Sell Back
Bookstore Condition | Item Price Shipping Total Cost Store link |
|---|---|
Also check: Knetbooks, BiggerBooks
Bookstore Condition | Item Price Shipping Total Cost Store link |
|---|---|
Also check: BiggerBooks, Knetbooks, AbeBooks
Bookstore Condition | Item Price Shipping Total Cost Store link |
|---|---|
Also check: eCampus
Bookstore Condition | Item Price Shipping Total Cost Store link |
|---|---|
Also check: Knetbooks, BiggerBooks
Bookstore Condition | Item Price Shipping Total Cost Store link |
|---|---|
Also check: BiggerBooks, Knetbooks, AbeBooks
Bookstore Condition | Item Price Shipping Total Cost Store link |
|---|---|
Prices checked Oct 19, 2026, 5:35 PM ET. Prices change often; the store's checkout price is final.
Renting vs. Buying This Textbook
Renting is usually cheapest if you only need the book for one term: you return it with a free prepaid label when the term ends. Buying used can beat renting when the sell-back price is high, so compare the sell-back price with the rental price before you decide. An eTextbook arrives instantly but usually expires. Rentals and used copies rarely include working access codes.
Always match the ISBN on your syllabus (9781584885955) before you order; different editions have different ISBNs.
About This Book
This handbook provides comprehensive coverage of basic concepts and recent developments in the field. Focusing on design, proof of correctness, and complexity analysis, this volume presents a detailed discussion of algorithms that are useful in a variety of applications and offers an authoritative review of the current state of the art. Using figures to help illustrate the concepts, the book examines topics, such as incremental algorithms and online algorithms, that have yet to receive much attention but have great potential for future applications.