共 50 条
- [1] ON AN ALGORITHM TO ENUMERATE ALL THE CUTSETS IN A GRAPH [J]. ELECTRONICS & COMMUNICATIONS IN JAPAN, 1978, 61 (07): : 9 - 15
- [2] A new algorithm for generating all minimal cutsets in a graph [J]. Dongbei Daxue Xuebao/Journal of Northeastern University, 2001, 22 (05): : 576 - 579
- [3] ENUMERATION OF ALL CUTSETS OF A GRAPH [J]. PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1968, 56 (07): : 1247 - &
- [5] SIMPLEX ALGORITHM ON A LINEAR GRAPH - UNIFIED VIEW OF EXTREMAL PATH AND CUTSET PROBLEMS ON A GRAPH [J]. ELECTRONICS & COMMUNICATIONS IN JAPAN, 1974, 57 (11): : 26 - 33
- [6] SIMPLEX ALGORITHM ON A LINEAR GRAPH - UNIFIED VIEW OF EXTREMAL PATH AND CUTSET PROBLEMS ON A GRAPH [J]. NEC RESEARCH & DEVELOPMENT, 1975, (37-3): : 50 - 58
- [7] ENUMERATION OF ALL CIRCUITS OR CUTSETS OF A GRAPH [J]. ELECTRONICS LETTERS, 1970, 6 (04) : 104 - &
- [8] ALGEBRAIC DETERMINATION OF ALL VERTEX CUTSETS IN A GRAPH [J]. PROCEEDINGS OF THE INSTITUTION OF ELECTRICAL ENGINEERS-LONDON, 1969, 116 (04): : 510 - &
- [10] ALGORITHMS FOR ENUMERATING ALL THE s-t CUTSETS IN O( vertical V vertical plus vertical E vertical ) PER CUTSET. [J]. Electronics & communications in Japan, 1979, 62 (01): : 9 - 20