Pages that link to "Item:Q2500532"
From MaRDI portal
The following pages link to NP-completeness results for edge modification problems (Q2500532):
Displaying 45 items.
- Reducing rank of the adjacency matrix by graph modification (Q344771) (← links)
- Graph editing to a fixed target (Q344855) (← links)
- Graph modification problem for some classes of graphs (Q350726) (← links)
- Minimum \(d\)-blockers and \(d\)-transversals in graphs (Q411244) (← links)
- Unit interval editing is fixed-parameter tractable (Q515577) (← links)
- Matching interdiction (Q602686) (← links)
- Complexity and parameterized algorithms for cograph editing (Q690461) (← links)
- Editing to a planar graph of given degrees (Q730508) (← links)
- Editing to Eulerian graphs (Q896016) (← links)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- Blockers and transversals (Q1043948) (← links)
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid (Q1045154) (← links)
- Two edge modification problems without polynomial kernels (Q1662097) (← links)
- On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion} (Q1679221) (← links)
- An \(O(n^2)\) time algorithm for the minimal permutation completion problem (Q1720313) (← links)
- A polynomial kernel for trivially perfect editing (Q1799208) (← links)
- An NP-completeness result of edge search in graphs (Q2014718) (← links)
- Indirect identification of horizontal gene transfer (Q2040274) (← links)
- On the threshold of intractability (Q2051847) (← links)
- (Sub)linear kernels for edge modification problems toward structured graph classes (Q2093576) (← links)
- Exact-2-relation graphs (Q2197422) (← links)
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes (Q2232241) (← links)
- MPF problem over modified medial semigroup is NP-complete (Q2333870) (← links)
- On the hardness of solving edge matching puzzles as SAT or CSP problems (Q2342584) (← links)
- Editing to a graph of given degrees (Q2354405) (← links)
- Editing to a connected graph of given degrees (Q2407094) (← links)
- Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
- A cubic-vertex kernel for flip consensus tree (Q2441594) (← links)
- Critical edges for the assignment problem: complexity and exact resolution (Q2450758) (← links)
- Biclique-Helly graphs (Q2478166) (← links)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
- A cubic vertex-kernel for \textsc{Trivially Perfect Editing} (Q2696282) (← links)
- An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem (Q2827805) (← links)
- Exploring the subexponential complexity of completion problems (Q2828210) (← links)
- Efficient Algorithms for Eulerian Extension (Q3057616) (← links)
- Parameterized Complexity of Eulerian Deletion Problems (Q3104771) (← links)
- Editing to a Planar Graph of Given Degrees (Q3194713) (← links)
- Reducing Rank of the Adjacency Matrix by Graph Modification (Q3196399) (← links)
- Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
- Two Edge Modification Problems without Polynomial Kernels (Q3656868) (← links)
- NP-completeness for minimizing maximum edge length in grid embeddings (Q3677185) (← links)
- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs (Q5387826) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- Switches in Eulerian graphs (Q6621269) (← links)
