Algorithms on Trees and Graphs: With Python Code (Texts in Computer Science)
$87.99 / copy at 25+ copies As low as $85.99 at 100+Your best volume price
Total $2,199.75
Format
The more copies, the less each one costs
Applied automatically in your cart. No code needed.
Built for school and campus orders
PDF quotes, purchase orders, tax exemption and multi-site delivery, handled by one account manager.
PDF quotes, purchase orders, tax exemption and help with vendor setup.
For schools Make it yoursBookplates, tipped-in pages, belly bands or author signatures. Hardcovers only, subject to publisher approval.
Customization options Ship to every readerOne address, many sites or individual recipients' homes, in the US and abroad.
Fulfillment optionsAlgorithms on Trees and Graphs
This textbook introduces graph algorithms on an intuitive basis followed by a detailed exposition using structured pseudocode, with correctness proofs as well as worst-case analyses. Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, like approximation, combinatorial optimization, graphics, and operations research, graph algorithms have recently attracted increased attention from computational biology, bioinformatics, and computational chemistry. Centered around the fundamental issue of graph isomorphism, this book goes beyond classical graph problems of shortest paths, spanning trees, flows in networks, and matchings in bipartite graphs. Advanced algorithmic results and techniques of practical relevance are presented in a coherent and consolidated way. Furthermore, Python code for all algorithms presented is given in a appendix. Numerous illustrations, examples, problems, exercises, and a comprehensive bibliography support students and professionals in using the book as a text and source of reference.
The book, Algorithms on Trees and Graphs: With Python Code (Texts in Computer Science) [Bulk, Wholesale, Quantity] ISBN#9783030818845 in Hardcover by Gabriel Valiente may be ordered in bulk quantities. Minimum starts at 25 copies. Availability based on publisher status and quantity being ordered.
Details
- Publisher
- Springer International Publishing
- Author
- Gabriel Valiente
- Format
- Hardcover
- Published
- Oct 12, 2021
- ISBN-13
- 9783030818845
- Pages
- 387
- Printing
- Printed on demand
Algorithms on Trees and Graphs in bulk: pricing
Volume pricing applies automatically in your cart. No codes, no account needed.
| Copies | Price per copy | You save |
|---|---|---|
| 25 – 49 | $87.99 | 12% off list |
| 50 – 99 | $86.99 | 13% off list |
| 100+ | $85.99 | 14% off list |
Popular for
A copy for every student in the class or section.
Shared reading for professional development.
Common reads and first-year programs.
How fast can I get copies of Algorithms on Trees and Graphs?
This title is printed on demand, so it needs production time before it ships. Need them by a specific date? Request a quote and we'll confirm timing before you pay.
Can you ship to several locations or people's homes?
Yes. We ship in bulk to one address, to multiple sites, or to individual recipients, in the US and internationally. See fulfillment options.
Can I get a formal quote for approval before ordering?
Yes. Request a quote and we'll send a PDF you can forward for approval.
Do you accept purchase orders and tax-exempt orders?
Yes. We accept purchase orders upon approval, as well as cards, PayPal, ACH, wire transfers and checks. BookPal is a tax-exempt supplier in all 50 states. See purchase orders and sales tax exemption.
What if I find a lower price?
Send us the link. We match prices from other bulk booksellers and distributors on a new copy in the same edition, available to ship in the quantity you need. Clearance sales and pricing errors are the exception, and we'll tell you quickly if that's the case. Start a price match.
Write a Review
Algorithms on Trees and Graphs: With Python Code (Texts in Computer Science)
Groups also order




A colleague asked you to approve this order
Your quote list
Add books as you browse, then request one quote for all of them.