Laplacians for flow networks
We define a class of Laplacians for multicommodity, undirected flow networks, and bound their smallest nonzero eigenvalues with a generalization of the sparsest cut.
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Society for Industrial and Applied Mathematics
2012
|
| Online Access: | http://hdl.handle.net/1721.1/69117 https://orcid.org/0000-0002-2621-7633 |
| _version_ | 1826209179742765056 |
|---|---|
| author | Taylor, Joshua A. Hover, Franz S. |
| author2 | Massachusetts Institute of Technology. Department of Mechanical Engineering |
| author_facet | Massachusetts Institute of Technology. Department of Mechanical Engineering Taylor, Joshua A. Hover, Franz S. |
| author_sort | Taylor, Joshua A. |
| collection | MIT |
| description | We define a class of Laplacians for multicommodity, undirected flow networks, and bound their smallest nonzero eigenvalues with a generalization of the sparsest cut. |
| first_indexed | 2024-09-23T14:18:45Z |
| format | Article |
| id | mit-1721.1/69117 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T14:18:45Z |
| publishDate | 2012 |
| publisher | Society for Industrial and Applied Mathematics |
| record_format | dspace |
| spelling | mit-1721.1/691172022-10-01T20:31:54Z Laplacians for flow networks Taylor, Joshua A. Hover, Franz S. Massachusetts Institute of Technology. Department of Mechanical Engineering Hover, Franz S. Hover, Franz S. We define a class of Laplacians for multicommodity, undirected flow networks, and bound their smallest nonzero eigenvalues with a generalization of the sparsest cut. United States. Office of Naval Research (grant N00014-02-1-0623) United States. Office of Naval Research (grant N00014-09-1-0700) 2012-02-15T19:05:07Z 2012-02-15T19:05:07Z 2011-09 2011-06 Article http://purl.org/eprint/type/JournalArticle 0895-4801 1095-7146 http://hdl.handle.net/1721.1/69117 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 https://orcid.org/0000-0002-2621-7633 en_US http://dx.doi.org/10.1137/100787726 SIAM Journal on Discrete Mathematics 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. application/pdf Society for Industrial and Applied Mathematics SIAM |
| spellingShingle | Taylor, Joshua A. Hover, Franz S. Laplacians for flow networks |
| title | Laplacians for flow networks |
| title_full | Laplacians for flow networks |
| title_fullStr | Laplacians for flow networks |
| title_full_unstemmed | Laplacians for flow networks |
| title_short | Laplacians for flow networks |
| title_sort | laplacians for flow networks |
| url | http://hdl.handle.net/1721.1/69117 https://orcid.org/0000-0002-2621-7633 |
| work_keys_str_mv | AT taylorjoshuaa laplaciansforflownetworks AT hoverfranzs laplaciansforflownetworks |