46 citations · 163 across the 13 of their papers we have counts for
5 papers · 1 filter
Hermitian Laplacians and a Cheeger inequality for the Max-2-Lin problem
Huan Li, He Sun, Luca Zanetti
We study spectral approaches for the MAX-2-LIN(k) problem, in which we are given a system of linear equations of the form , and required to find…
Spectral Subspace Sparsification
Huan Li, Aaron Schild
We introduce a new approach to spectral sparsification that approximates the quadratic form of the pseudoinverse of a graph Laplacian restricted to a subspace. We show that sparsif…
Maximizing the Number of Spanning Trees in a Connected Graph
Huan Li, Stacy Patterson, Yuhao Yi +1
We study the problem of maximizing the number of spanning trees in a connected graph by adding at most edges from a given candidate edge set. We give both algorithmic and hardn…
Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket
Liren Shan, Huan Li, Zhongzhi Zhang
As a fundamental subject of theoretical computer science, the maximum independent set (MIS) problem not only is of purely theoretical interest, but also has found wide applications…
Current Flow Group Closeness Centrality for Complex Networks
Huan Li, Richard Peng, Liren Shan +2
Current flow closeness centrality (CFCC) has a better discriminating ability than the ordinary closeness centrality based on shortest paths. In this paper, we extend this notion to…