Pages that link to "Item:Q2445333"
From MaRDI portal
The following pages link to A faster FPT algorithm for bipartite contraction (Q2445333):
Displaying 23 items.
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
- Edge bipartization faster than \(2^k\) (Q666655) (← 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)
- A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
- FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425) (← links)
- On the parameterized complexity of grid contraction (Q2672940) (← links)
- A single exponential-time FPT algorithm for cactus contraction (Q2697543) (← links)
- (Q2867082) (redirect page) (← links)
- Obtaining a bipartite graph by contracting few edges (Q2911626) (← links)
- Bidimensionality: new connections between FPT algorithms and PTASs (Q2921717) (← links)
- On the Parameterized Complexity of Contraction to Generalization of Trees. (Q5111860) (← links)
- Paths to Trees and Cacti (Q5283353) (← links)
- Contracting to a longest path in H-free graphs (Q6065420) (← links)
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs (Q6084414) (← links)
- On the Parameterized Complexity of Maximum Degree Contraction Problem. (Q6089673) (← links)
- Reducing the vertex cover number via edge contractions (Q6098145) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
