„graph modification“
Suchergebnisse
509 Treffer
-
Modification Problems Toward Proper (Helly) Circular-Arc Graphs
-
Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes
-
A Modification of the Random Cutting Model
-
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 Cubic Vertex-Kernel for Trivially Perfect Editing
-
Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings
-
An FPT Algorithm for Elimination Distance to Bounded Degree Graphs
-
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
-
An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes
-
Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies
-
Modification of Graphitic Carbon Nitride/Pyromellitic Diimide as a Robust Fluorescent Probe for Silver Detection in Water
-
Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems
-
Modification to Planarity is Fixed Parameter Tractable
-
A Polynomial Kernel for Diamond-Free Editing