✦ LIBER ✦

Listing all Minimal Separators of a Graph

✍ Scribed by Kloks, T.; Kratsch, D.

Book ID: 118178146
Publisher: Society for Industrial and Applied Mathematics
Year: 1998
Tongue: English
Weight: 287 KB
Volume: 27
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s009753979427087x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 linear time algorithm to list the mini

A linear time algorithm to list the minimal separators of chordal graphs

✍ L. Sunil Chandran; Fabrizio Grandoni 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 193 KB

A Simple Algorithm for Listing All the T

A Simple Algorithm for Listing All the Trees of a Graph

✍ Minty, G. 📂 Article 📅 1965 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 157 KB

Minimal separators of 2-chordal graphs

✍ Scott McCullough 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 959 KB

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

An algorithm for evaluating all the mini

An algorithm for evaluating all the minimal cuts of a graph

✍ Brijendra Singh 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 190 KB