Laplacians for flow networks
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.MSC codes05C2105C5090B10Keywordsspectral graph theorymulticommodity flow networkCheeger inequalitysparsest cut