Sparsest cuts and bottlenecks in graphs
- 1 May 1990
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 27 (1-2) , 113-123
- https://doi.org/10.1016/0166-218x(90)90133-w
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The maximum concurrent flow problemJournal of the ACM, 1990
- Interprocessor Traffic Scheduling Algorithm for Multiple-Processor NetworksIEEE Transactions on Computers, 1987
- An Efficient Algorithm for Finding Multicommodity Flows in Planar NetworksSIAM Journal on Computing, 1985