✦ LIBER ✦

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

✍ Scribed by Sankar, V.; Prasad, V.C.; Rao, K.S.P.

Book ID: 114555049
Publisher: IEEE
Year: 1993
Tongue: English
Weight: 193 KB
Volume: 42
Category: Article
ISSN: 0018-9529
DOI: 10.1109/24.210269

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

✍ Arunkumar, S.; Lee, S.H. 📂 Article 📅 1979 🏛 IEEE 🌐 English ⚖ 764 KB

An Algorithm to Enumerate All Cutsets of

An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset

✍ Tsukiyama, S.; Shirakawa, I.; Ozaki, H.; Ariyoshi, H. 📂 Article 📅 1980 🏛 Association for Computing Machinery 🌐 English ⚖ 691 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

Simple enumeration of minimal cutsets se

Simple enumeration of minimal cutsets separating 2 vertices in a class of undirected planar graphs

✍ Sung, C.S.; Yoo, B.K. 📂 Article 📅 1992 🏛 IEEE 🌐 English ⚖ 674 KB

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

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