„kernelization algorithms“
Suchergebnisse
65 Treffer
-
PACE Solver Description: Cluster Editing Kernelization Using CluES
-
Polynomial Kernels for Strictly Chordal Edge Modification Problems
-
Dynamic Kernels for Hitting Sets and Set Packing
-
On Approximate Compressions for Connected Minor-Hitting Sets
-
A Cubic Vertex-Kernel for Trivially Perfect Editing
-
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration
-
Exploiting c-Closure in Kernelization Algorithms for Graph Problems
-
Optimal Polynomial-Time Compression for Boolean Max CSP
-
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
-
A Polynomial Kernel for 3-Leaf Power Deletion
-
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
-
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization
-
An Approximate Kernel for Connected Feedback Vertex Set
-
Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms
-
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around
-
On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure
-
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
-
Triangle Packing in (Sparse) Tournaments: Approximation and Kernelization
-
Lossy Kernels for Hitting Subgraphs
-
The Power of Linear-Time Data Reduction for Maximum Matching