Pages that link to "Item:Q2441588"
From MaRDI portal
The following pages link to Contracting graphs to paths and trees (Q2441588):
Displaying 29 items.
- Kernelization and randomized parameterized algorithms for co-path set problem (Q328686) (← links)
- Graph editing to a fixed target (Q344855) (← links)
- Increasing the minimum degree of a graph by contractions (Q385061) (← links)
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
- Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
- Multistage graph problems on a global budget (Q831134) (← 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)
- The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853) (← links)
- An improved linear kernel for the cycle contraction problem (Q2274484) (← links)
- The complexity of degree anonymization by graph contractions (Q2407102) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
- On the parameterized complexity of grid contraction (Q2672940) (← links)
- A single exponential-time FPT algorithm for cactus contraction (Q2697543) (← links)
- (Q2891337) (redirect page) (← links)
- Hadwiger Number of Graphs with Small Chordality (Q2945190) (← links)
- Smaller Kernels for Several FPT Problems Based on Simple Observations (Q3452562) (← links)
- (Q5089236) (← links)
- On the Parameterized Complexity of Contraction to Generalization of Trees. (Q5111860) (← links)
- Paths to Trees and Cacti (Q5283353) (← links)
- Contracting chordal graphs and bipartite graphs to paths and trees (Q5891098) (← 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)
