Pages that link to "Item:Q4645941"
From MaRDI portal
The following pages link to A polyhedral approach to the feedback vertex set problem (Q4645941):
Displayed 10 items.
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (Q444386) (← 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)
- 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)
- (Q5743513) (← links)
- Algorithms for finding maximum transitive subtournaments (Q5963652) (← links)