A contraction algorithm for finding small cycle cutsets
Authors:
- Hanoch LevyHLHanoch Levy
- David W LowDLDavid W Low
- 1 December 1988
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 9 (4) , 470-493
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Feedback vertex sets and cyclically reducible graphsJournal of the ACM, 1985
- Robust linear algorithms for cutsetsJournal of Algorithms, 1982
- A Linear Time Algorithm for Finding Minimum Cutsets in Reducible GraphsSIAM Journal on Computing, 1979
- Optimum tearing in large scale systems and minimum feedback cutsets of a digraphJournal of the Franklin Institute, 1979
- The identification of a minimal feedback vertex set of a directed graphIEEE Transactions on Circuits and Systems, 1975
- Characterizations of Reducible Flow GraphsJournal of the ACM, 1974
- Flow Graph ReducibilitySIAM Journal on Computing, 1972
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972