Truss decomposition on shared-memory parallel systems
The scale of data used in graph analytics grows at an unprecedented rate. More than ever,
domain experts require efficient and parallel algorithms for tasks in graph analytics. One …
domain experts require efficient and parallel algorithms for tasks in graph analytics. One …
Accelerating truss decomposition on heterogeneous processors
Truss decomposition is to divide a graph into a hierarchy of subgraphs, or trusses. A
subgraph is ak-truss (k≥ 2) if each edge is in at least k---2 triangles in the subgraph …
subgraph is ak-truss (k≥ 2) if each edge is in at least k---2 triangles in the subgraph …
Fast triangle counting using cilk
A Yaşar, S Rajamanickam, M Wolf… - 2018 IEEE High …, 2018 - ieeexplore.ieee.org
Triangle counting is a representative graph analysis algorithm with several applications. It is
also one of the three benchmarks used in the IEEE HPEC Graph Challenge. Triangle …
also one of the three benchmarks used in the IEEE HPEC Graph Challenge. Triangle …
Fast parallel algorithms for counting and listing triangles in big graphs
Big graphs (networks) arising in numerous application areas pose significant challengesfor
graph analysts as these graphs grow to billions of nodes and edges and are prohibitively …
graph analysts as these graphs grow to billions of nodes and edges and are prohibitively …
Lightning fast and space efficient k-clique counting
K-clique counting is a fundamental problem in network analysis which has attracted much
attention in recent years. Computing the count of k-cliques in a graph for a large k (eg, k= 8) …
attention in recent years. Computing the count of k-cliques in a graph for a large k (eg, k= 8) …
Graphchallenge. org: Raising the bar on graph analytic performance
S Samsi, V Gadepally, M Hurley… - 2018 IEEE High …, 2018 - ieeexplore.ieee.org
The rise of graph analytic systems has created a need for new ways to measure and
compare the capabilities of graph processing systems. The MIT/Amazon/IEEE Graph …
compare the capabilities of graph processing systems. The MIT/Amazon/IEEE Graph …
Engineering a distributed-memory triangle counting algorithm
Counting triangles in a graph and incident to each vertex is a fundamental and frequently
considered task of graph analysis. We consider how to efficiently do this for huge graphs …
considered task of graph analysis. We consider how to efficiently do this for huge graphs …
Logarithmic radix binning and vectorized triangle counting
Triangle counting is a building block for numerous graph applications and given the fact that
graphs continue to grow in size, its scalability is important. As such, numerous algorithms …
graphs continue to grow in size, its scalability is important. As such, numerous algorithms …
Graphchallenge. org triangle counting performance
The rise of graph analytic systems has created a need for new ways to measure and
compare the capabilities of graph processing systems. The MIT/Amazon/IEEE Graph …
compare the capabilities of graph processing systems. The MIT/Amazon/IEEE Graph …
Scalable triangle counting on distributed-memory systems
S Acer, A Yaşar, S Rajamanickam… - 2019 IEEE High …, 2019 - ieeexplore.ieee.org
Triangle counting is a foundational graph-analysis kernel in network science. It has also
been one of the challenge problems for the “Static Graph Challenge”. In this work, we …
been one of the challenge problems for the “Static Graph Challenge”. In this work, we …