The path resistance method for bounding &lgr;2 of a Laplacian
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian
Combinatorics, Probability and Computing
The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian
Combinatorics, Probability and Computing
A distributed dynamical scheme for fastest mixing Markov chains
ACC'09 Proceedings of the 2009 conference on American Control Conference
Hi-index | 0.00 |