17 citations · 17 across the 2 of their papers we have counts for
2 papers
cs.DS2013★ 17 cited
Improved Cheeger's Inequality: Analysis of Spectral Partitioning Algorithms through Higher Order Spectral Gap
Tsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee +2
Let ϕ(G) be the minimum conductance of an undirected graph G, and let 0=λ_1 <= λ_2 <=... <= λ_n <= 2 be the eigenvalues of the normalized Laplacian matrix of G. We prove that for a…
cs.DM2009
Computing Graph Roots Without Short Cycles
Babak Farzad, Lap Chi Lau, Van Bang Le +1
Graph G is the square of graph H if two vertices x, y have an edge in G if and only if x, y are of distance at most two in H. Given H it is easy to compute its square H2, however M…