✦ LIBER ✦

Circular convex bipartite graphs: Feedback vertex sets

✍ Scribed by Liu, Tian; Lu, Min; Lu, Zhao; Xu, Ke

Book ID: 122287788
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 547 KB
Volume: 556
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.05.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Subset feedback vertex sets in chordal g

Subset feedback vertex sets in chordal graphs

✍ Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Saei, Reza 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 234 KB

Feedback vertex set on cocomparability g

Feedback vertex set on cocomparability graphs

✍ Satyan R. Coorg; C. Pandu Rangan 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 716 KB

Circular convex bipartite graphs: Maximu

Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits

✍ Y.Daniel Liang; Norbert Blum 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 447 KB

Parallel maximum independent set in conv

Parallel maximum independent set in convex bipartite graphs

✍ Artur Czumaj; Krzysztof Diks; Teresa M. Przytycka 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 606 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