Reproduce “Computing top-k Closeness Centrality Faster in Unweighted Graphs” 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

Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.