„Kernelization“
Suchergebnisse
210 Treffer
-
On the Parameterized Complexity of Clique Elimination Distance
-
Exploiting c-Closure in Kernelization Algorithms for Graph Problems
-
Optimal Polynomial-Time Compression for Boolean Max CSP
-
Approximate Turing Kernelization for Problems Parameterized by Treewidth
-
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
-
Kernelization of Whitney Switches
-
A Polynomial Kernel for Line Graph Deletion
-
A Polynomial Kernel for 3-Leaf Power Deletion
-
On Quasipolynomial Multicut-Mimicking Networks and Kernelization of Multiway Cut Problems
-
On the Parameterized Complexity of Grid Contraction
-
Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies
-
Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs
-
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
-
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover
-
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization
-
An Approximate Kernel for Connected Feedback Vertex Set
-
A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs
-
On Kernelization for Edge Dominating Set under Structural Parameters
-
Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms
-
Best-Case and Worst-Case Sparsifiability of Boolean CSPs