Algorithms For Streaming Graphs: Approaching Graph Problems With Limited Memory And Without Random,New
Algorithms For Streaming Graphs: Approaching Graph Problems With Limited Memory And Without Random,New

Algorithms For Streaming Graphs: Approaching Graph Problems With Limited Memory And Without Random,New

In Stock
SKU: DADAX383810806X
Brand: Sudwestdeutscher Verlag Fur Hochschulschriften Ag
$77.22 $110.31
Save $33.09
Quantity
Add to wishlist
Add to compare

Processing time: 1-3 days

US Orders Ships in: 3-5 days

International Orders Ships in: 8-12 days

Return Policy: 15-days return on defective items

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

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.

Recently Viewed