Quadratic Kernelization for Convex Recoloring of Trees
From MaRDI portal
Publication:3608834
Recommendations
Cited in
(11)- Kernelization: new upper and lower bound techniques
- Convex Recoloring Revisited: Complexity and Exact Algorithms
- Quadratic kernelization for convex recoloring of trees
- Upper and lower bounds for finding connected motifs in vertex-colored graphs
- Constraining Images of Quadratic Arboreal Representations
- A kernel for convex recoloring of weighted forests
- A \(2^{O(k)}\)poly\((n)\) algorithm for the parameterized convex recoloring problem
- The balanced connected subgraph problem for geometric intersection graphs
- On the complexity of some colorful problems parameterized by treewidth
- Approximation and Online Algorithms
- Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems
This page was built for publication: Quadratic Kernelization for Convex Recoloring of Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608834)