Pages that link to "Item:Q4645941"

The following pages link to A polyhedral approach to the feedback vertex set problem (Q4645941):

Displaying 17 items.

• Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (Q444386) (← links)
• On the feedback vertex set polytope of a series-parallel graph (Q834183) (← links)
• Introduction to ABACUS -- a branch-and-cut system (Q1271386) (← links)
• Solving the feedback vertex set problem on undirected graphs (Q1975362) (← links)
• Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem (Q2028800) (← links)
• Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem (Q2171258) (← links)
• Almost always observable hybrid systems (Q2178194) (← links)
• Fixed-parameter tractability for subset feedback set problems with parity constraints (Q2344735) (← links)
• A constraint programming approach to cutset problems (Q2489126) (← links)
• Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs (Q2813347) (← links)
• Two Hardness Results on Feedback Vertex Sets (Q3004674) (← links)
• Improved Algorithms for the Feedback Vertex Set Problems (Q3603546) (← links)
• Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms (Q5302061) (← links)
• (Q5688508) (← links)
• (Q5743513) (← links)
• Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760) (← links)
• Algorithms for finding maximum transitive subtournaments (Q5963652) (← links)