Dynamic algorithms for k-center on graphs

no code implementations • 28 Jul 2023 • Emilio Cruciani, Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos

In this paper, we give a deterministic decremental $(2+\epsilon)$-approximation algorithm and a randomized incremental $(4+\epsilon)$-approximation algorithm, both with amortized update time $kn^{o(1)}$ for weighted graphs.

Local Algorithms for Estimating Effective Resistance

no code implementations • 7 Jun 2021 • Pan Peng, Daniel Lopatta, Yuichi Yoshida, Gramoz Goranci

Effective resistance is an important metric that measures the similarity of two vertices in a graph.

Clustering Graph Clustering +1

Faster Graph Embeddings via Coarsening

1 code implementation • ICML 2020 • Matthew Fahrbach, Gramoz Goranci, Richard Peng, Sushant Sachdeva, Chi Wang

As computing Schur complements is expensive, we give a nearly-linear time algorithm that generates a coarsened graph on the relevant vertices that provably matches the Schur complement in expectation in each iteration.

Link Prediction Node Classification