Algorithms for Streaming Graphs
by Mariano Zelke (9783838108063)

Algorithms for Streaming Graphs
 

Mariano Zelke


Release Date: 01 September 2009
Format: Paperback
Pages: 72
Category: Computer Science
Publisher: Sudwestdeutscher Verlag Fur Hochschulschrifte
ISBN: 9783838108063
ISBN-10: 383810806X



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 time-consuming. To tackle massive graphs stored on external memories, the semi-streaming 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 semi-streaming 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 semi-streaming model and give algorithms that approximate respective solutions in a randomized fashion.

AUD $130.95

 This title is not held in stock & is ordered from suppliers, subject to availability.



Write a customer review of Algorithms for Streaming Graphs.



If you like this title please tell others:

tell others

post to your Facebook wall post on Twitter post on Digg recommend to Stumbleupon bookmark on Delicious RSS feed send to a friend


Australian BookShop
Australian Bookshop. Established 2003
Search
Shopping Cart Customer Support


HolisticPage
International Online Store
of Inspiration
we ship everywhere
Australia Post
Australia Wide
.
Worldwide