Pages that link to "Item:Q2672425"
From MaRDI portal
The following pages link to FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425):
Displaying 5 items.
- Faster FPT algorithms for deletion to pairs of graph classes (Q2140510) (← links)
- Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
- (Q5111282) (← links)
- Deletion to scattered graph classes. I: Case of finite number of graph classes (Q6133645) (← links)
- Backdoor DNFs (Q6564620) (← links)