Pages that link to "Item:Q1975362"
From MaRDI portal
The following pages link to Solving the feedback vertex set problem on undirected graphs (Q1975362):
Displaying 17 items.
- On the feedback vertex set polytope of a series-parallel graph (Q834183) (← links)
- On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216) (← links)
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs (Q1273087) (← links)
- An efficient local search for the feedback vertex set problem (Q1736593) (← links)
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem (Q2028800) (← links)
- Feedback vertex sets in mesh-based networks (Q2383604) (← links)
- New upper bounds on feedback vertex numbers in butterflies (Q2390267) (← links)
- New formulations and branch-and-cut procedures for the longest induced path problem (Q2669795) (← links)
- An Improved Exact Algorithm for Undirected Feedback Vertex Set (Q2867116) (← links)
- Two Hardness Results on Feedback Vertex Sets (Q3004674) (← links)
- A fixed-parameter algorithm for the directed feedback vertex set problem (Q3452187) (← links)
- A polyhedral approach to the feedback vertex set problem (Q4645941) (← links)
- Decycling bipartite graphs (Q5084689) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902531) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Maximum weighted induced forests and trees: new formulations and a computational comparative review (Q6071056) (← links)
- Integer programming formulations for the \(k\)-in-a-tree problem in graphs (Q6495390) (← links)
