„graph modification problem“
Suchergebnisse
1.000+ Treffer
-
Compound Logics for Modification Problems
-
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs
-
Algorithm design techniques for parameterized graph modification problems
-
Graph Modification of Bounded Size to Minor-Closed Classes as Fast as Vertex Deletion
-
(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes
-
A Constant-Factor Approximation for Weighted Bond Cover
-
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL
-
Destroying Densest Subgraphs Is Hard
-
Polynomial Kernel and Incompressibility for Prison-Free Edge Deletion and Completion
-
On the Complexity of the Eigenvalue Deletion Problem
-
Modification Problems Toward Proper (Helly) Circular-Arc Graphs
-
Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes
-
Polynomial Kernels for Strictly Chordal Edge Modification Problems
-
Improved Kernels for Edge Modification Problems
-
(Sub)linear Kernels for Edge Modification Problems Towards Structured Graph Classes
-
A Polynomial Kernel for Paw-Free Editing
-
Vertex Deletion into Bipartite Permutation Graphs
-
Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth
-
Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy
-
A Polynomial Kernel for Line Graph Deletion