Data Structures And Network Algorithms (Cbmsnsf Regional Conference Series In Applied Mathematics, Series Number 44)

Data Structures And Network Algorithms (Cbmsnsf Regional Conference Series In Applied Mathematics, Series Number 44)

In Stock
SKU: SONG0898711878
Brand: Brand: Society For Industrial And Applied Mathematics
Condition: Used
Regular price$54.22
Quantity
Add to wishlist
Add to compare

Sold by Ergodebooks, an authorized reseller.

Returns accepted within 30 days | support@ergodebooks.com

Verified
Shipping Information
  • Free Standard Shipping — United States only
  • Processing Time: 1–3 business days
  • Estimated Delivery: 3–5 business days after dispatch
  • Double-boxed, fully insured & discreetly packaged
  • Tracking number sent via email once dispatched
  • Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund

Returns accepted within 30 days of delivery.

Damaged or Defective Item

Free return shipping + replacement or full refund

Wrong Item Received

Free return shipping + replacement or full refund

Change of Mind

Return shipping at customer's expense · 25% restocking fee applies

All returns require a Return Authorization (RA) number before sending.

To initiate a return, contact us:

support@ergodebooks.com +1 (281) 738-1050
View Full Return & Refund Policy
Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

There Has Been An Explosive Growth In The Field Of Combinatorial Algorithms. These Algorithms Depend Not Only On Results In Combinatorics And Especially In Graph Theory, But Also On The Development Of New Data Structures And New Techniques For Analyzing Algorithms. Four Classical Problems In Network Optimization Are Covered In Detail, Including A Development Of The Data Structures They Use And An Analysis Of Their Running Time. Data Structures And Network Algorithms Attempts To Provide The Reader With Both A Practical Understanding Of The Algorithms, Described To Facilitate Their Easy Implementation, And An Appreciation Of The Depth And Beauty Of The Field Of Graph Algorithms.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

  • Q: What is the page count of this book? A: This book contains one hundred and forty pages. It provides a comprehensive look at data structures and network algorithms.
  • Q: What is the binding type of this book? A: The binding type is paperback. This makes it lightweight and easy to carry.
  • Q: What are the dimensions of this book? A: The dimensions are seven point zero one inches in length, zero point five one inches in width, and ten inches in height. These measurements make it a convenient size for reading.
  • Q: Who is the author of this book? A: The author is Robert Endre Tarjan. He is known for his contributions to algorithms and data structures.
  • Q: What topics does this book cover? A: The book covers combinatorial algorithms, data structures, and network optimization. It details four classical problems in network optimization.
  • Q: Is this book suitable for beginners? A: Yes, this book is suitable for readers with a basic understanding of algorithms. It offers practical insights alongside theoretical concepts.
  • Q: How can I implement the algorithms discussed in this book? A: You can implement the algorithms as they are described to facilitate easy implementation. The book aims to provide practical understanding.
  • Q: What is the target audience for this book? A: The target audience includes students and professionals in mathematics and computer science. It is particularly useful for those interested in graph theory.
  • Q: How do I care for this book? A: Keep the book in a dry place and avoid exposure to direct sunlight. This will help maintain its condition.
  • Q: Can I find this book in good condition? A: Yes, this is a used book in good condition. It has been maintained well for continued reading.
  • Q: What should I do if I receive a damaged book? A: If you receive a damaged book, you should contact the seller for a return or replacement. Ensure you keep the original packaging for return purposes.
  • Q: Is there a warranty for this book? A: No, there is no warranty for this book. Used books typically do not come with warranties.
  • Q: What if I need help with understanding the content? A: You can seek help from online forums or study groups focused on algorithms and data structures. Many communities are available for assistance.
  • Q: How is this book different from others on algorithms? A: This book uniquely integrates practical understanding with theoretical depth in graph algorithms. It emphasizes combinatorial algorithms and network optimization.
  • Q: Is there a digital version of this book available? A: No, this book is available only in paperback. A digital version may not be published.
  • Q: What makes this book valuable for my studies? A: This book provides a solid foundation in data structures and algorithms, essential for computer science studies. Its practical approach aids in understanding complex concepts.

Recently Viewed