✦ LIBER ✦

Approximating Minimum Feedback Sets and Multicuts in Directed Graphs

✍ Scribed by G. Even; J. (Seffi) Naor; B. Schieber; M. Sudan

Publisher: Springer
Year: 1998
Tongue: English
Weight: 207 KB
Volume: 20
Category: Article
ISSN: 0178-4617
DOI: 10.1007/pl00009191

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximating minimum feedback vertex se

Approximating minimum feedback vertex sets in hypergraphs

✍ Toshihiro Fujito 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 102 KB

Minimum feedback vertex sets in cocompar

Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs

✍ Y. Daniel Liang; Maw-Shang Chang 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 165 KB

Finding a minimum feedback arc set in re

Finding a minimum feedback arc set in reducible flow graphs

✍ Vijaya Ramachandran 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 879 KB

On feedback vertex sets and nonseparatin

On feedback vertex sets and nonseparating independent sets in cubic graphs

✍ Ewald Speckenmeyer 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 341 KB

Let G be an undirected connected graph with n nodes. A subset F of nodes of G is a feedback vertex set (fvs) if G -F is a forest and a subset J of nodes of G is a nonseparating independent set (nsis) if no two nodes of J are adjacent and G -J is connected. f(G), z ( G ) denote the cardinalities of a

Minimal feedback vertex sets in directed

Minimal feedback vertex sets in directed split-stars

✍ Fu-Hsing Wang; Cheng-Ju Hsu; Jen-Chih Tsai 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

Point Set and Strong Point Set Dominatio

Point Set and Strong Point Set Domination in Graphs 1 Minimum spsd sets

✍ V. Swaminathan; R. Poovazhaki 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 218 KB