Reproduce “Shared-memory Graph Truss Decomposition” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Humayun Kabir, Kamesh Madduri
PKT computes exact k-truss decompositions on large sparse graphs by peeling edges level by level in parallel on shared-memory multicore machines. It assigns each triangle to the lower-ID edge’s thread, preventing duplicate support updates. On 24 cores, it achieves a 9.68× geometric-mean speedup over parallel Ros; as-skitter reaches 13.97×, on tested graphs only.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.