Algorithms for Streaming Graphs

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

Approaching Graph Problems with Limited Memory and without Random Access

Autor: Mariano Zelke

Limbă:

Legare: Carte broșată

Editura: Sudwestdeutscher Verlag Fur Hochschulschriften AG

Disponibilitate: În depozitul extern

Expediem în 8-11 zile

259.49 lei

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

Informații despre carte

Autor

Mariano Zelke

Limbă

germană

Legare

Carte - Carte broșată

Publicat

2009

Pagini

EAN

9783838108063

ISBN

383810806X

Enbook ID

07165368

Editura

Sudwestdeutscher Verlag Fur Hochschulschriften AG

Greutate

109

Dimensiuni

152 x 229 x 5

Descriere completă

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.

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Algorithms for Streaming Graphs

Approaching Graph Problems with Limited Memory and without Random Access

Informații despre carte

Descriere completă

S-ar putea să te intereseze

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

Analogieschluss, der Skeptizismus und eine Offenbarungsreligion

Clienții care au cumpărat această carte au mai cumpărat și

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