Pages that link to "Item:Q3012825"
From MaRDI portal
The following pages link to Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q3012825):
Displaying 37 items.
- On group feedback vertex set parameterized by the size of the cutset (Q262251) (← links)
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (Q444386) (← links)
- Packing cycles through prescribed vertices under modularity constraints (Q444427) (← links)
- Enumerating minimal subset feedback vertex sets (Q472481) (← links)
- Disjoint cycles intersecting a set of vertices (Q713977) (← links)
- An FPT algorithm for edge subset feedback edge set (Q763477) (← links)
- Graphs without two vertex-disjoint \(S\)-cycles (Q785795) (← links)
- Kernels for deletion to classes of acyclic digraphs (Q1678165) (← links)
- A randomized polynomial kernel for subset feedback vertex set (Q1702849) (← links)
- An improved FPT algorithm for almost forest deletion problem (Q1751414) (← links)
- Finding temporal paths under waiting time constraints (Q1979453) (← links)
- Faster deterministic \textsc{Feedback Vertex Set} (Q2015151) (← links)
- FPT algorithms for generalized feedback vertex set problems (Q2110739) (← links)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q2169982) (← links)
- Half-integral packing of odd cycles through prescribed vertices (Q2259381) (← links)
- Subset feedback vertex set on graphs of bounded independent set size (Q2304562) (← links)
- Parameterised algorithms for deletion to classes of DAGs (Q2322699) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Fixed-parameter tractability for subset feedback set problems with parity constraints (Q2344735) (← links)
- A polynomial kernel for block graph deletion (Q2408204) (← links)
- Subset feedback vertex sets in chordal graphs (Q2447531) (← links)
- Towards a polynomial kernel for directed feedback vertex set (Q2663705) (← links)
- Fixed parameterized algorithms for generalized feedback vertex set problems (Q2693637) (← links)
- Half-integrality, LP-branching, and FPT Algorithms (Q2816829) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (Q3448850) (← links)
- (Q5009483) (← links)
- (Q5111250) (← links)
- (Q5111282) (← links)
- (Q5136298) (← links)
- Improved FPT Algorithms for Deletion to Forest-Like Structures. (Q6065438) (← links)
- A parameterized algorithm for subset feedback vertex set in tournaments (Q6076355) (← links)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q6119835) (← links)
- On Weighted Graph Separation Problems and Flow Augmentation (Q6187079) (← links)
- Improved FPT Algorithms for Deletion to Forest-Like Structures (Q6492092) (← links)
