1. Flow graph reducibility;Hecht;SIAM J. Comput.,1972
2. An n log n algorithm for detecting reducible graphs;Hopcroft,1972
3. Reducibility among combinatorial problems;Karp,1974
4. A New Algorithm for Finding Small Cycle Cutsets;Levy;IBM Los Angeles Scientific Center Report G3202721,1983
5. A linear time algorithm for finding minimum cutsets in reducible graphs;Shamir;SIAM J. Comput.,1979