Laplacians for flow networks
Author(s)Taylor, Joshua A.; Hover, Franz S.
MetadataShow full item record
We define a class of Laplacians for multicommodity, undirected flow networks, and bound their smallest nonzero eigenvalues with a generalization of the sparsest cut.
DepartmentMassachusetts Institute of Technology. Department of Mechanical Engineering
SIAM Journal on Discrete Mathematics
Society for Industrial and Applied Mathematics
Taylor, Joshua A., and Franz S. Hover. “Laplacians for Flow Networks.” SIAM Journal on Discrete Mathematics 25.3 (2011): 1349. Web. 15 Feb. 2012. © 2011 Society for Industrial and Applied Mathematics
Final published version