Title
Algorithms For Streaming Graphs: Approaching Graph Problems With Limited Memory And Without Random,New
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
An Algorithm Solving A Graph Problem Is Usually Expected To Have Fast Random Access To The Input Graph G And A Working Memory Being Able To Store G Completely. These Powerful Assumptions Are Put In Question By Massive Graphs That Exceed Common Working Memories And That Can Only Be Stored On Disks Or Even Tapes. Here, Random Access Is Very Timeconsuming. To Tackle Massive Graphs Stored On External Memories, The Semistreaming Model Has Been Proposed. It Permits A Working Memory Of Restricted Size And Forbids Random Access To G. In Contrast, The Input Is Assumed To Be A Stream Of Edges In Arbitrary Order. In This Book We Develop Algorithms In The Semistreaming Model Approaching Different Graph Problems. For The Problems Of Testing Graph Connectivity And Bipartiteness And For The Computation Of A Minimum Spanning Tree, We Show How To Obtain Optimal Running Times. For The Intractable Problem Of Finding A Maximum Weighted Matching, We Present The Best Known Approximation Algorithm. Finally, We Show The Minimum And The Maximum Cut Problem In A Graph Both To Be Intractable In The Semistreaming Model And Give Algorithms That Approximate Respective Solutions In A Randomized Fashion.
⚠️ 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.