Laplacians for flow networks

Author(s)
Taylor, Joshua A.; Hover, Franz S.
Thumbnail
DownloadTaylor-2011-LAPLACIANS FOR FLOW.pdf (165.9Kb)
PUBLISHER_POLICY
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.
Metadata
Show full item record
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.
Date issued
2011-09
URI
http://hdl.handle.net/1721.1/69117
Department
Massachusetts Institute of Technology. Department of Mechanical Engineering
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
ISSN
0895-4801
1095-7146
Collections