Pages that link to "Item:Q3503584"
From MaRDI portal
The following pages link to FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs (Q3503584):
Displaying 9 items.
- FPT algorithms for path-transversal and cycle-transversal problems (Q456698) (← links)
- Simple and improved parameterized algorithms for multiterminal cuts (Q987378) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425) (← links)
- On Multiway Cut Parameterized above Lower Bounds (Q2891333) (← links)
- Improved FPT Algorithms for Rectilinear k-Links Spanning Path (Q2898068) (← links)
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q3012825) (← links)
- Multicut Is FPT (Q4605273) (← links)
- (Q5743380) (← links)