Fetching the paper…
Reading the bibliography…
Graph analysis performs many random reads and writes, thus, these workloads are typically performed in memory.
A functional approach to external graph algorithms
1998
Earlier work this paper cites.
The anatomy of a large-scale hypertextual web search engine
1998
Earlier work this paper cites.
Collective dynamics of ’small-world’ networks
1998
Earlier work this paper cites.
A faster algorithm for betweenness centrality
2001
Earlier work this paper cites.
Learning from labeled and unlabeled data with label propagation
2002
Earlier work this paper cites.
MapReduce: Simplified data processing on large clusters
2004
Earlier work this paper cites.
Efficient semi-streaming algorithms for local triangle counting in massive graphs
2008
Earlier work this paper cites.
Fast unfolding of communities in large networks
2008
Earlier work this paper cites.
PEGASUS: A peta-scale graph mining system implementation and observations
2009
Earlier work this paper cites.
Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters
2009
Earlier work this paper cites.
On the efficiency and programmability of large graph processing in the cloud
2010
Earlier work this paper cites.
What is twitter, a social network or a news media?
2010
Cited alongside, same era.
Pregel: A system for large-scale graph processing
2010
Cited alongside, same era.
Multithreaded asynchronous graph traversal for in-memory and semi-external memory
2010
Cited alongside, same era.
Graph Algorithms in the Language of Linear Algebra
2011
Cited alongside, same era.
Direction-optimizing breadth-first search
2012
Cited alongside, same era.
PowerGraph: Distributed graph-parallel computation on natural graphs
2012
Cited alongside, same era.
Graphchi: Large-scale graph computation on just a PC
Turbograph: a fast parallel graph engine handling billion-scale graphs in a single pc
2013
Later among the works it cites.
A lightweight infrastructure for graph analytics
2013
Later among the works it cites.
X-stream: Edge-centric graph processing using streaming partitions
2013
Later among the works it cites.
Trinity: A distributed graph engine on a memory cloud
2013
Later among the works it cites.
Ligra: A lightweight graph processing framework for shared memory
2013
Later among the works it cites.
Toward millions of file system IOPS on low-cost, commodity hardware
2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2012
Cited alongside, same era.
Distributed GraphLab: A framework for machine learning and data mining in the cloud
2012
Cited alongside, same era.
A flexible open-source toolbox for scalable complex graph analysis
2012
Cited alongside, same era.
A parallel page cache: Iops and caching for multicore systems
2012
Cited alongside, same era.
The design and implementation of modern column-oriented database systems
2013
Cited alongside, same era.
Apache giraph · 2014
Closest in time.
Locality statistics for anomaly detection in time series of graphs
2014
Closest in time.
http://webdatacommons.org/hyperlinkgraph/
Web graph · 2014
Closest in time.
Maiter: An asynchronous graph processing framework for delta-based accumulative iterative computation
2014
Closest in time.
Active community detection in massive graphs
2015
Closest in time.