Laplacians for flow networks
Name
Taylor-2011-LAPLACIANS FOR FLOW.pdf
Size
165.94 KB
Format
Adobe PDF
Checksum (MD5)
b2a802fafbb48a549f7fab958e9aa7d5
Author(s)
Taylor, Joshua A.
Hover, Franz S.
Date Issued
September 2011
Journal
SIAM Journal on Discrete Mathematics
Publisher
Society for Industrial and Applied Mathematics
Citation
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
Version
Final published version
Abstract
We define a class of Laplacians for multicommodity, undirected flow networks, and bound their smallest nonzero eigenvalues with a generalization of the sparsest cut.
MIT Department
Massachusetts Institute of Technology. Department of Mechanical Engineering
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1137/100787726
