Pages that link to "Item:Q1693129"
From MaRDI portal
The following pages link to A faster parameterized algorithm for pseudoforest deletion (Q1693129):
Displaying 13 items.
- Faster deterministic algorithm for cactus vertex deletion (Q2094388) (← links)
- FPT algorithms for generalized feedback vertex set problems (Q2110739) (← links)
- An improved deterministic parameterized algorithm for cactus vertex deletion (Q2135634) (← links)
- Parameterized orientable deletion (Q2182093) (← links)
- Fixed parameterized algorithms for generalized feedback vertex set problems (Q2693637) (← links)
- Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel (Q4637327) (← links)
- Improved FPT Algorithms for Deletion to Forest-Like Structures. (Q6065438) (← links)
- Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands (Q6087776) (← links)
- Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm (Q6115414) (← links)
- Transportation Problem Allowing Sending and Bringing Back (Q6175213) (← links)
- Improved FPT Algorithms for Deletion to Forest-Like Structures (Q6492092) (← links)
- Knapsack: connectedness, path, and shortest-path (Q6547953) (← links)
- Faster parameterized algorithm for \(r\)-pseudoforest deletion (Q6664062) (← links)
