Solving the feedback vertex set problem on undirected graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1003266 (Why is no real title available?)
- scientific article; zbMATH DE number 1175963 (Why is no real title available?)
- A Greedy Heuristic for the Set-Covering Problem
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs
- A polyhedral approach to the feedback vertex set problem
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
- Almost exact minimum feedback vertex set in meshes and butterflies
- Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs
- Feedback vertex set on cocomparability graphs
- Feedback vertex sets and cyclically reducible graphs
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- On locating minimum feedback vertex sets
- Reducibility among combinatorial problems
- Solution of large weighted equicut problems
- Tabu Search—Part I
Cited in
(18)- Graph-Theoretic Concepts in Computer Science
- Feedback vertex sets in mesh-based networks
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- Integer programming formulations for the \(k\)-in-a-tree problem in graphs
- A fixed-parameter algorithm for the directed feedback vertex set problem
- Algorithm 815
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem
- Decycling bipartite graphs
- MIP formulations for induced graph optimization problems: a tutorial
- A polyhedral approach to the feedback vertex set problem
- On the feedback vertex set polytope of a series-parallel graph
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
- An efficient local search for the feedback vertex set problem
- Two Hardness Results on Feedback Vertex Sets
- New upper bounds on feedback vertex numbers in butterflies
- New formulations and branch-and-cut procedures for the longest induced path problem
- An Improved Exact Algorithm for Undirected Feedback Vertex Set
- Maximum weighted induced forests and trees: new formulations and a computational comparative review
This page was built for publication: Solving the feedback vertex set problem on undirected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1975362)
