Pages that link to "Item:Q2015151"
From MaRDI portal
The following pages link to Faster deterministic \textsc{Feedback Vertex Set} (Q2015151):
Displaying 20 items.
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- On feedback vertex set: new measure and new structures (Q494933) (← links)
- Dynamic parameterized problems (Q722546) (← links)
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
- A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
- (Q5005155) (← links)
- (Q5009469) (← links)
- (Q5111250) (← links)
- (Q5136298) (← links)
- (Q5140722) (← links)
- A naive algorithm for feedback vertex set (Q5240414) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Improved FPT Algorithms for Deletion to Forest-Like Structures. (Q6065438) (← links)
- A parameterized algorithm for subset feedback vertex set in tournaments (Q6076355) (← links)
- (Q6089665) (← links)
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes (Q6098156) (← links)
- Deletion to scattered graph classes. I: Case of finite number of graph classes (Q6133645) (← links)
- Kernelization for feedback vertex set via elimination distance to a forest (Q6153475) (← links)
- Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams (Q6185609) (← links)
- Improved FPT Algorithms for Deletion to Forest-Like Structures (Q6492092) (← links)
