книги Наука, техника, медицина Естественные науки Точные науки Математика Научные издания Теория вероятностей

Algorithms for Streaming Graphs. Approaching Graph Problems with Limited Memory and without Random Access

Код 898749

Нет в продаже

Аннотация к книге "Algorithms for Streaming Graphs. Approaching Graph Problems with Limited Memory and without Random Access"

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...

Оставить комментарий

Оцените книгу:

Издательство: Книга по требованию
Дата выхода: июль 2011
ISBN: 978-3-8381-0806-3
Объём: 72 страниц
Масса: 129 г
Размеры(высота, ширина, толщина), см: 23 x 16 x 1

Вместе с этой книгой покупают