✦ LIBER ✦

On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms

✍ Scribed by Fedor V. Fomin; Serge Gaspers; Artem V. Pyatkin; Igor Razgon

Publisher: Springer
Year: 2007
Tongue: English
Weight: 358 KB
Volume: 52
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-007-9152-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Linear Time Algorithm for the Minimum-

A Linear Time Algorithm for the Minimum-weight Feedback Vertex Set Problem in Series-parallel Graphs

✍ Shao-qiang Zhang; Guo-jun Li; Shu-guang Li 📂 Article 📅 2004 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 169 KB

On the feedback vertex set problem in pe

On the feedback vertex set problem in permutation graphs

✍ Y. Daniel Liang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 603 KB

Exact algorithms for the vertex separato

Exact algorithms for the vertex separator problem in graphs

✍ Cid C. de Souza; Victor F. Cavalcante 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 242 KB

New bounds on the size of the minimum fe

New bounds on the size of the minimum feedback vertex set in meshes and butterflies

✍ Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 113 KB

On the nonseparating independent set pro

On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three

✍ Shuichi Ueno; Yoji Kajitani; Shin'ya Gotoh 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 350 KB

This paper shows that both the nonseparating independent set problem and feedback set problem can be solved in polynomial time for graphs with no vertex degree exceeding 3 by reducing the problems to the matroid parity problem.

Exact and heuristic algorithms for solvi

Exact and heuristic algorithms for solving the generalized minimum filter placement problem

✍ E. Chisonge Mofya; J. Cole Smith 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 385 KB