49 citations · 112 across the 6 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014★ 49 cited
Partitioning Well-Clustered Graphs: Spectral Clustering Works!
Richard Peng, He Sun, Luca Zanetti
In this paper we study variants of the widely used spectral clustering that partitions a graph into k clusters by (1) embedding the vertices of a graph into a low-dimensional space…
quant-ph2014★ 33 cited
A quantum-walk-inspired adiabatic algorithm for graph isomorphism
Dario Tamascelli, Luca Zanetti
We present a 2-local quantum algorithm for graph isomorphism GI based on an adiabatic protocol. By exploiting continuous-time quantum-walks, we are able to avoid a mere diffusion o…