A linear time algorithm for graph partition problems
- 27 April 1992
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 42 (1) , 19-24
- https://doi.org/10.1016/0020-0190(92)90126-g
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Sparsest cuts and bottlenecks in graphsDiscrete Applied Mathematics, 1990
- The maximum concurrent flow problemJournal of the ACM, 1990