Algorithms for Streaming Graphs

Name: Algorithms for Streaming Graphs
Brand: Sudwestdeutscher Verlag Fur Hochschulschriften AG
SKU: 9783838108063
Price: 197.62 PLN
Availability: InStock

Approaching Graph Problems with Limited Memory and without Random Access

Autor: Mariano Zelke

Język:

Oprawa: Miękka

Wydawca: Sudwestdeutscher Verlag Fur Hochschulschriften AG

Dostępność: Dostępna u dostawcy

Wysyłamy za 8-11 dni

197.62 zł

An algorithm solving a graph problem is usually expected to have fast random access to the input gra...

Informacje o książce

Autor

Mariano Zelke

Język

Niemiecki

Oprawa

Książka - Miękka

Data wydania

2009

strony

EAN

9783838108063

ISBN

383810806X

Enbook ID

07165368

Wydawca

Sudwestdeutscher Verlag Fur Hochschulschriften AG

Waga

109

Wymiary

152 x 229 x 5

Pełny opis

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.

Możesz być zainteresowany

Klienci, którzy kupili tę książkę, kupili również

Najczęściej wyszukiwane

Categories

Authors

Publishers

Produkty

Produkty

Najczęściej wyszukiwane

Categories

Authors

Publishers

Produkty

Produkty

Algorithms for Streaming Graphs

Approaching Graph Problems with Limited Memory and without Random Access

Informacje o książce

Pełny opis

Możesz być zainteresowany

Wohin des Weges, liebe Seele? Life is a Story - story.one

Analogieschluss, der Skeptizismus und eine Offenbarungsreligion

Klienci, którzy kupili tę książkę, kupili również

Black Robe, Vol. III

Working in Conflict - Working on Conflict

Comment lire avec les oreilles

Voice for My Soul

Murder in Megara

Letras hispanicas en la gran pantalla

Ancient Law

History of the French Revolution. Translated by F. Shoberl

Honourable Estate.

Her Gentle Deeds. [a Tale.]

TOEIC Testbuilder Student's Book & MPO Pack

History of Witches and Wizards

Smoke

Pandora's Hope

Vulnerability Analysis and Risk Assessment

Concept de Communication Dans Les Manuels Du Fle

The Theory of Magnetism I

Politics of the Global Economic Crisis

ASP.NET Web API 2: Building a REST Service from Start to Finish

Air Pollution Modeling and Its Application III