Finding a minimum feedback arc set in reducible flow graphs
- 30 September 1988
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 9 (3) , 299-313
- https://doi.org/10.1016/0196-6774(88)90022-3
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- The complexity of minimum cut and maximum flow problems in an acyclic networkNetworks, 1987
- A Linear Time Algorithm for Finding Minimum Cutsets in Reducible GraphsSIAM Journal on Computing, 1979
- Testing flow graph reducibilityJournal of Computer and System Sciences, 1974
- Characterizations of Reducible Flow GraphsJournal of the ACM, 1974