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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1349-1364 |
| Number of pages | 16 |
| Journal | SIAM Journal on Discrete Mathematics |
| Volume | 25 |
| Issue number | 3 |
| DOIs | |
| State | Published - 2011 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- General Mathematics
Keywords
- Cheeger inequality
- Multicommodity flow network
- Sparsest cut
- Spectral graph theory
Fingerprint
Dive into the research topics of 'Laplacians for flow networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver