Open Access
External-Memory Graph Algorithms
Yi-Feng Chian,Michael T. Goodrich,Edward Grove,Roberto Tamassia,Darren Erik Vengroff,Jeffrey Scott Vitter +5 more
- pp 139-149
Reads0
Chats0
About:
The article was published on 1995-01-01 and is currently open access. It has received 313 citations till now. The article focuses on the topics: Null graph & Line graph.read more
Citations
More filters
ReportDOI
Large-scale Graph Computation on Just a PC
TL;DR: This work presents GraphChi, a disk-based system for computing efficiently on graphs with billions of edges, and builds on the basis of Parallel Sliding Windows to propose a new data structure Partitioned Adjacency Lists, which is used to design an online graph database graphChi-DB.
Journal ArticleDOI
External memory algorithms and data structures: dealing with massive data
TL;DR: The state of the art in the design and analysis of external memory algorithms and data structures, where the goal is to exploit locality in order to reduce the I/O costs is surveyed.
Journal ArticleDOI
A Survey on PageRank Computing
TL;DR: The theoretical foundations of the PageRank formulation are examined, the acceleration of PageRank computing, in the effects of particular aspects of web graph structure on the optimal organization of computations, and in PageRank stability.
Journal ArticleDOI
On the sorting-complexity of suffix tree construction
TL;DR: A recursive technique for building suffix trees that yields optimal algorithms in different computational models that match the sorting lower bound and for an alphabet consisting of integers in a polynomial range the authors get the first known linear-time algorithm.
Book
Algorithms and Data Structures for External Memory
TL;DR: The state of the art in the design and analysis of algorithms and data structures for external memory (or EM for short), where the goal is to exploit locality and parallelism in order to reduce the I/O costs is surveyed.
References
More filters
Journal ArticleDOI
The input/output complexity of sorting and related problems
Alok Aggarwal,S. Vitter Jeffrey +1 more
TL;DR: Tight upper and lower bounds are provided for the number of inputs and outputs (I/OS) between internal memory and secondary storage required for five sorting-related problems: sorting, the fast Fourier transform (FFT), permutation networks, permuting, and matrix transposition.
Journal ArticleDOI
An introduction to disk drive modeling
Chris Ruemmler,John Wilkes +1 more
TL;DR: A calibrated, high-quality disk drive model is demonstrated in which the overall error factor is 14 times smaller than that of a simple first-order model, which enables an informed trade-off between effort and accuracy.
Book
Deterministic coin tossing with applications to optimal parallel list ranking
TL;DR: The algorithms apply a novel “random-like” deterministic technique that provides for a fast and efficient breaking of an apparently symmetric situation in parallel and distributed computation.
Proceedings ArticleDOI
Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm
TL;DR: This algorithm provides the first proof that the min-cut problem for weighted undirected graphs is in 7ZAfC, and does more than find a single mm-cut; it finds all of them.
Journal ArticleDOI
Recursive star-tree parallel data structure
Omer Berkman,Uzi Vishkin +1 more
TL;DR: This paper introduces a novel parallel data structure called the recursive star-tree, derived by using recursion in the spirit of the inverse Ackermann function, which allows for extremely fast parallel computations, specifically, $O(\alpha (n)$ time.