Polynomial-size enumeration kernelizations for long path enumeration
From MaRDI portal
Cites work
- A 4k^2 kernel for feedback vertex set
- Depth-first search and the vertex cover problem
- Deterministic algorithms for matching and packing problems based on representative sets
- Efficient computation of representative families with applications in parameterized and exact algorithms
- Fundamentals of parameterized complexity
- Kernel bounds for path and cycle problems
- Kernelization for counting problems on graphs: preserving the number of minimum solutions
- Kernelization of counting problems
- Kernelization. Theory of parameterized preprocessing
- Lossy kernelization
- Matching (multi)cut: algorithms, complexity, and enumeration
- Narrow sieves for parameterized paths and packings
- On problems without polynomial kernels
- Paradigms for parameterized enumeration
- Parameterized algorithms
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- Polynomial-delay and polynomial-space enumeration of large maximal matchings
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
- Representative families of product families
- Subquadratic kernels for implicit 3-{\textsc{Hitting Set}} and 3-{\textsc{Set Packing}} problems
- The complexity ecology of parameters: An illustration using bounded max leaf number
- Turing kernelization for finding long paths and cycles in restricted graph classes
- Turing kernelization for finding long paths in graph classes excluding a topological minor
This page was built for publication: Polynomial-size enumeration kernelizations for long path enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294441)
