( en | de | ru )

 

Disambiguation of "Zanetti, Luca"

Author of the publication

copydeleteadd this publication to your clipboard
Partitioning Well-Clustered Graphs: Spectral Clustering Works!

, , and . COLT, volume 40 of JMLR Workshop and Conference Proceedings, page 1423-1455. JMLR.org, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Fortunato Zanetti

Massimo Zanetti

Sandro Zanetti

Wolfgang Zanetti

Luca Rizzini

 

Other publications of authors with the same name

Geometric Bounds on the Fastest Mixing Markov Chain., and . ITCS, volume 215 of LIPIcs, page 109:1-109:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Partitioning Well-Clustered Graphs: Spectral Clustering Works!, , and . COLT, volume 40 of JMLR Workshop and Conference Proceedings, page 1423-1455. JMLR.org, (2015)Algorithms for partitioning well-clustered graphs.. University of Bristol, UK, (2018)British Library, EThOS.Partitioning Well-Clustered Graphs with k-Means and Heat Kernel., , and . CoRR, (2014)Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem., , and . ESA, volume 144 of LIPIcs, page 71:1-71:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Distributed Graph Clustering and Sparsification., and . ACM Trans. Parallel Comput., 6 (3): 17:1-17:23 (2019)Distributed Graph Clustering by Load Balancing., and . SPAA, page 163-171. ACM, (2017)An iterative spectral algorithm for digraph clustering., , and . J. Complex Networks, (February 2024)An iterative spectral algorithm for digraph clustering., , and . CoRR, (January 2025)Wireless Network Topology Inference: A Markov Chains Approach., , and . CoRR, (January 2025)