Pages that link to "Item:Q1838829"
From MaRDI portal
The following pages link to On the NP-hardness of edge-deletion and -contraction problems (Q1838829):
Displaying 26 items.
- Increasing the minimum degree of a graph by contractions (Q385061) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- Deleting edges to restrict the size of an epidemic: a new application for treewidth (Q1635713) (← 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)
- Complexity and algorithms for constant diameter augmentation problems (Q2072060) (← links)
- Parameterized complexity of fair deletion problems (Q2174554) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- On the parameterized complexity of grid contraction (Q2672940) (← links)
- Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem (Q2676471) (← links)
- A single exponential-time FPT algorithm for cactus contraction (Q2697543) (← links)
- Increasing the Minimum Degree of a Graph by Contractions (Q2891338) (← links)
- Contraction Blockers for Graphs with Forbidden Induced Paths (Q2947020) (← links)
- Path Contraction Faster than $2^n$ (Q3300757) (← links)
- Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth (Q3467872) (← links)
- The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases (Q3507648) (← links)
- (Q5089236) (← links)
- Path Contraction Faster Than 2^n (Q5091159) (← links)
- On the Parameterized Complexity of Contraction to Generalization of Trees. (Q5111860) (← links)
- Paths to Trees and Cacti (Q5283353) (← 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)
- Classical and quantum compression for edge computing: the ubiquitous data dimensionality reduction (Q6114596) (← links)
