Pages that link to "Item:Q5948964"
From MaRDI portal
The following pages link to Complexity classification of some edge modification problems (Q5948964):
Displaying 50 items.
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- Chordal editing is fixed-parameter tractable (Q300460) (← links)
- Graph editing to a fixed target (Q344855) (← links)
- Graph modification problem for some classes of graphs (Q350726) (← links)
- Matching interdiction (Q602686) (← links)
- Polynomial kernels for 3-leaf power graph modification problems (Q602747) (← links)
- Parameterized complexity of even/odd subgraph problems (Q635735) (← links)
- Strongly chordal and chordal bipartite graphs are sandwich monotone (Q652637) (← links)
- Complexity and parameterized algorithms for cograph editing (Q690461) (← links)
- Editing to a planar graph of given degrees (Q730508) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- A vertex incremental approach for maintaining chordality (Q819824) (← links)
- On the effectiveness of the incremental approach to minimal chordal edge modification (Q820555) (← links)
- Additive approximation of generalized Turán questions (Q832525) (← links)
- Editing to Eulerian graphs (Q896016) (← links)
- Minimal split completions (Q967310) (← links)
- On the complexity of some subgraph problems (Q967414) (← links)
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- Chordal deletion is fixed-parameter tractable (Q973007) (← links)
- On listing, sampling, and counting the chordal graphs with edge constraints (Q974754) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- Dynamically maintaining split graphs (Q1026107) (← links)
- Hardness of edge-modification problems (Q1034612) (← links)
- Blockers and transversals (Q1043948) (← links)
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid (Q1045154) (← links)
- Deleting edges to restrict the size of an epidemic: a new application for treewidth (Q1635713) (← links)
- Two edge modification problems without polynomial kernels (Q1662097) (← links)
- On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion} (Q1679221) (← links)
- Cluster graph modification problems (Q1885821) (← links)
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- On the threshold of intractability (Q2051847) (← links)
- Incompressibility of \(H\)-free edge modification problems: towards a dichotomy (Q2071824) (← links)
- (Sub)linear kernels for edge modification problems toward structured graph classes (Q2093576) (← links)
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes (Q2232241) (← links)
- Applying modular decomposition to parameterized cluster editing problems (Q2272201) (← links)
- A new approximate cluster deletion algorithm for diamond-free graphs (Q2292150) (← links)
- Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results (Q2297848) (← links)
- Modifying a graph using vertex elimination (Q2345941) (← links)
- Faster parameterized algorithms for deletion to split graphs (Q2350905) (← links)
- Covering tree with stars (Q2354301) (← links)
- Editing to a graph of given degrees (Q2354405) (← links)
- Additive approximation for edge-deletion problems (Q2389218) (← links)
- Editing to a connected graph of given degrees (Q2407094) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
- A cubic-vertex kernel for flip consensus tree (Q2441594) (← links)
- Minimal comparability completions of arbitrary graphs (Q2476257) (← links)
- NP-completeness results for edge modification problems (Q2500532) (← links)
