Title
Allurement of Some Graph Algorithms,Used
Sold by Ergodebooks, an authorized reseller.
Returns accepted within 30 days | support@ergodebooks.com
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
Payment Option
The last five decades have witnessed an upsurge of interest and activity in graph theory, particularly among mathematicians and engineers. It has recently emerged as a subject in its own right, as well as being an important mathematical tool in such diverse subjects as operational research, computer science, networking, mobile computing, sociology and many other fields. This book is devoted entirely to computational aspects of graph theory, including graphtheoretic algorithms. The book provide some new algorithms of graph theory such as generation all spanning trees, minimal spanning tree generation, graph colouring algorithm, importance of some special graphs in networking, hiding information and applications of graphs in different areas. The book is useful for graduate and post graduate students of science and engineering and new research scholar to motivate them in the field of graph theory.
⚠️ 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.