Learning hierarchical cluster structure of graphs in sublinear time

DOI10.1137/1.9781611977554.CH36MaRDI QIDQ6538564zbMATH OpenFDO

Authors Michael Kapralov, A. Kumar, Silvio Lattanzi, Aida Mousavifar

Publication date 14 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977554.CH36

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Approximating Dasgupta cost in sublinear time from a few random seeds

This page was built for publication: Learning hierarchical cluster structure of graphs in sublinear time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538564)