Pages that link to "Item:Q2445333"
From MaRDI portal
The following pages link to A faster FPT algorithm for bipartite contraction (Q2445333):
Displayed 11 items.
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- Obtaining split graphs by edge contraction (Q897961) (← links)
- Paths to trees and cacti (Q1998842) (← links)
- On the parameterized complexity of contraction to generalization of trees (Q2000005) (← links)
- Reducing graph transversals via edge contractions (Q2037191) (← links)
- An improved linear kernel for the cycle contraction problem (Q2274484) (← links)
- The complexity of degree anonymization by graph contractions (Q2407102) (← links)
- Item:Q2445333 (redirect page) (← links)
- (Q5111860) (← links)
- Paths to Trees and Cacti (Q5283353) (← links)