✦ LIBER ✦

Enumeration of All Minimal Cut-Sets for a Node Pair in a Graph

✍ Scribed by Arunkumar, S.; Lee, S.H.

Book ID: 117933904
Publisher: IEEE
Year: 1979
Tongue: English
Weight: 764 KB
Volume: R-28
Category: Article
ISSN: 0018-9529
DOI: 10.1109/tr.1979.5220473

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumeration of all minimal cut-sets for

Enumeration of all minimal cut-sets for a node pair in a graph : S. Arunkumar and S. H. Lee. IEEE Trans. Reliab.R-28, (1) 51 (1979)

📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 131 KB

Comments on "Enumeration of all minimal

Comments on "Enumeration of all minimal cutsets for a node pair in a graph

✍ Sankar, V.; Prasad, V.C.; Rao, K.S.P. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 193 KB

Determination of All Minimal Cut-Sets be

Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph

✍ Abel, U.; Bicker, R. 📂 Article 📅 1982 🏛 IEEE 🌐 English ⚖ 821 KB

A new simple algorithm for enumerating a

A new simple algorithm for enumerating all minimal paths and cuts of a graph

✍ Yuanlong Shen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 195 KB

Efficient enumeration of all minimal sep

Efficient enumeration of all minimal separators in a graph

✍ Hong Shen; Weifa Liang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 796 KB

This paper presents an efficient algorithm for enumerating all minimal a-b separators separating given non-adjacent vertices a and b in an undirected connected simple graph G = (V,E). Our algorithm requires O(n3R,b) time, which improves the known result of 0(n4R,b) time for solving this problem, whe

A Method for Evaluating All the Minimal

A Method for Evaluating All the Minimal Cuts of a Graph

✍ Jasmon, G. B.; Foong, K. W. 📂 Article 📅 1987 🏛 IEEE 🌐 English ⚖ 973 KB