Graph stream algorithms
ACM SIGMOD Record · 13.05.2014 · 43 (1) · 9-20
DOI: 10.1145/2627692.2627694 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM SIGMOD Record, online erschienen am 13.05.2014. Verfasst von Andrew McGregor. Die Arbeit wurde bisher 263-mal zitiert (Crossref) und nennt 62 Literaturangaben.
Abstract (Originalsprache)
Over the last decade, there has been considerable interest in designing algorithms for processing massive graphs in the data stream model. The original motivation was two-fold: a) in many applications, the dynamic graphs that arise are too large to be stored in the main memory of a single machine and b) considering graph problems yields new insights into the complexity of stream computation. However, the techniques developed in this area are now finding applications in other areas including data structures for dynamic graphs, approximation algorithms, and distributed and parallel computation. We survey the state-of-the-art results; identify general techniques; and highlight some simple algorithms that illustrate basic ideas.
Zitieren
APA
McGregor, A. (2014). Graph stream algorithms. ACM SIGMOD Record, 43(1), 9-20. https://doi.org/10.1145/2627692.2627694
Vancouver
McGregor A. Graph stream algorithms. ACM SIGMOD Record. 2014;43(1):9-20. doi:10.1145/2627692.2627694
BibTeX
@article{McGregor2014,
author = {McGregor, Andrew},
title = {Graph stream algorithms},
journal = {ACM SIGMOD Record},
year = {2014},
volume = {43},
number = {1},
pages = {9--20},
doi = {10.1145/2627692.2627694}
}
EUVIMED