22 citations · 28 across the 9 of their papers we have counts for
3 papers · 2 filters
Shared-memory Graph Truss Decomposition
Humayun Kabir, Kamesh Madduri
We present PKT, a new shared-memory parallel algorithm and OpenMP implementation for the truss decomposition of large sparse graphs. A k-truss is a dense subgraph definition that c…
Distributed-Memory Breadth-First Search on Massive Graphs
Aydin Buluc, Scott Beamer, Kamesh Madduri +2
This chapter studies the problem of traversing large graphs using the breadth-first search order on distributed-memory supercomputers. We consider both the traditional level-synchr…
Distributed Graph Layout for Scalable Small-world Network Analysis
George M Slota, Sivasankaran Rajamanickam, Kamesh Madduri
The in-memory graph layout or organization has a considerable impact on the time and energy efficiency of distributed memory graph computations. It affects memory locality, inter-t…