✦ LIBER ✦

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

✍ Scribed by Tsukiyama, S.; Shirakawa, I.; Ozaki, H.; Ariyoshi, H.

Book ID: 115526531
Publisher: Association for Computing Machinery
Year: 1980
Tongue: English
Weight: 691 KB
Volume: 27
Category: Article
ISSN: 0004-5411
DOI: 10.1145/322217.322220

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A linear time algorithm to compute a dom

A linear time algorithm to compute a dominating path in an AT-free graph

✍ Derek G. Corneil; Stephan Olariu; Lorna Stewart 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 477 KB

A linear-time algorithm for computing th

A linear-time algorithm for computing the intersection of all odd cycles in a graph

✍ Leizhen Cai; Baruch Schieber 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 506 KB

We present a linear-time algorithm that finds all edges and vertices in the intersection of all odd cycles in a given graph. We also show an application of our algorithm to a variant of the satisfiability problem of Boolean formulas.

A linear-time algorithm to find a pair o

A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph

✍ Kristóf Bérczi; Satoru Fujishige; Naoyuki Kamiyama 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 185 KB