S. Tsukiyama
- 1 AIHARA, K An approach to enumerating all elementary paths and cut-sets by Gausstan ehminatton method IECE of Japan Trans A 58-.4, I0 (Oct 1975), 9-16 (m Japanese)Google Scholar
- 2 AIHARA, K, AND SHINODA, S Generation of cutsets by elementary 2-tree transformations--m the case of planar graphs Mono IECE of Japan CT72-70 (Jan 1973) (m Japanese)Google Scholar
- 3 ARIYOSHI, H Cut-set graph and systematic generauon of separating sets IEEE Trans Carcutt Theory CT-19, 3 (May 1972), 233-240Google Scholar
- 4 ARIYOSHI, H, AND HIGASHIYAMA, Y Generatton of s-t separating sets m acychc graphs IECE of Japan Trans A 58-A, 10 (Oct 1975), 657-664 (m Japanese)Google Scholar
- 5 FRATTA, L, AND MONTANARI, U A Boolean algebra method for computing the terminal rehabihty in a communtcatlon network IEEE Trans Circutt Theory CT-20, 3 (May 1973), 203-211Google Scholar
- 6 HOPCROFT, J., AND TAR JAN, R. Algonthm 447 Efficient algonthms for graph manipulation {H} Commun. ACM 16, 6 (June 1973), 372-378. Google Scholar
- 7 JENSEN, P.A, AND BELLMORE, M An algorithm to determine the reliabihty of a complex system IEEE Trans. Reha&hty R-I& 4 (Nov 1969), 169-174.Google Scholar
- 8 MARTELLI, A. An apphcauon of regular algebra to the enumerauon of the cut sets in a graph. In Information Processing 74, North-Holland, Amsterdam, 1974, pp 511-515.Google Scholar
- 9 MARTELLI, A. A Gausstan elimination algonthm for enumerauon of cut sets m a graph ~ A CM 23, I (Jan 1976), 58-73 Google Scholar
- 10 MAYEDA, W. Maxtmal flow through a commumcatton networks Interim Tech Rep No 13, Contract CA- 11-022-ORD-1983, Umv Illinois, Urbana, I11, 1960Google Scholar
- 11 NELSON, A C, BAx"rs, J R, AND BEADLES, R L A computer program for approxmaatmg system rehabthty IEEE Trans Rehabihty R-19, 2 (May 1970), 61-65Google Scholar
- 12 OHSE, H, AND AIHARA, K. An algebratc approach to finding elementary cut sets using Gausslan ehmmaUon method Mono IECE of Japan CST73-63 (Dec 1973) (m Japanese)Google Scholar
- 13 YAU, S S GeneralizaUon of the cut-set J Franklin Inst. 273, 1 (Jan 1962), 31-48Google Scholar
Index Terms
- An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
Recommendations
On stable cutsets in claw-free graphs and planar graphs
A stable cutset in a connected graph is a stable set whose deletion disconnects the graph. Let K"4 and K"1","3 (claw) denote the complete (bipartite) graph on 4 and 1+3 vertices. It is NP-complete to decide whether a line graph (hence a claw-free graph) ...
Disjoint clique cutsets in graphs without long holes
A biclique cutset is a cutset that induces the disjoint union of two cliques. A hole is an induced cycle with at least five vertices. A graph is biclique separable if it has no holes and each induced subgraph that is not a clique contains a clique ...
A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph
A set D of vertices of a graph G=(V,E) is a dominating set of G if every vertex in V@?D has at least one neighbor in D. A dominating set D of G is a paired-dominating set of G if the induced subgraph, G[D], has a perfect matching. The paired-domination ...
Comments