Скачать
Robert E. Tarjan, Concurrent Connected Components, University of Vienna, Communication Technologies
Автор: Peter Kindermann
Загружено: 2019-02-20
Просмотров: 222
Описание:
Finding the connected components of a graph is one of the most basic graph problems. Although it is easy to find components sequentially using graph search or a disjoint set union algorithm, some important applications require finding the components of huge graphs, making sequential algorithms too slow. We describe recent progress on concurrent algorithms for this problem. Some simple algorithms seem surprisingly hard to analyze.
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке:
