A polyhedral approach to the feedback vertex set problem
From MaRDI portal
Publication:4645941
Recommendations
- Parameterized and Exact Computation
- Solving the feedback vertex set problem on undirected graphs
- On the feedback vertex set problem for a planar graph
- Improved algorithms for feedback vertex set problems
- Improved Algorithms for the Feedback Vertex Set Problems
- FPT algorithms for generalized feedback vertex set problems
- Simultaneous feedback vertex set: a parameterized perspective
- Simultaneous feedback vertex set: a parameterized perspective
- Fixed parameterized algorithms for generalized feedback vertex set problems
- scientific article; zbMATH DE number 1029225
Cites work
- scientific article; zbMATH DE number 3888925 (Why is no real title available?)
- scientific article; zbMATH DE number 3848625 (Why is no real title available?)
- scientific article; zbMATH DE number 139781 (Why is no real title available?)
- scientific article; zbMATH DE number 780782 (Why is no real title available?)
- scientific article; zbMATH DE number 780783 (Why is no real title available?)
- General topological results on the construction of a minimum essential set of a directed graph
- Introduction to ABACUS -- a branch-and-cut system
- On the acyclic subgraph polytope
- On the feedback vertex set problem for a planar graph
- Reducibility among combinatorial problems
- Robust linear algorithms for cutsets
- Weakly bipartite graphs and the max-cut problem
Cited in
(16)- A constraint programming approach to cutset problems
- Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
- Almost always observable hybrid systems
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem
- Fixed-parameter tractability for subset feedback set problems with parity constraints
- Algorithms for finding maximum transitive subtournaments
- Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
- Introduction to ABACUS -- a branch-and-cut system
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
- scientific article; zbMATH DE number 970357 (Why is no real title available?)
- Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs
- On the feedback vertex set polytope of a series-parallel graph
- Solving the feedback vertex set problem on undirected graphs
- Two Hardness Results on Feedback Vertex Sets
- Improved Algorithms for the Feedback Vertex Set Problems
- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
This page was built for publication: A polyhedral approach to the feedback vertex set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645941)
