Algorithms Streaming Graphs Approaching by Zelke Mariano (2 results)
Language: English
Published by Südwestdeutscher Verlag für Hochschulschriften, 2015
- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 47.46
£ 59.84 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Algorithms for Streaming Graphs | Approaching Graph Problems with Limited Memory and without Random Access | Mariano Zelke | Taschenbuch | 72 S. | Deutsch | 2015 | Südwestdeutscher Verlag für Hochschulschriften | EAN 9783838108063 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarp…en 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu.
Language: English
Published by Südwestdeutscher Verlag Für Hochschulschriften AG Co. KG, 2009
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 47.46
£ 51.83 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.
