Pages that link to "Item:Q300460"
From MaRDI portal
The following pages link to Chordal editing is fixed-parameter tractable (Q300460):
Displaying 31 items.
- Unit interval editing is fixed-parameter tractable (Q515577) (← links)
- Rank reduction of oriented graphs by vertex and edge deletions (Q722520) (← links)
- Solving problems on graphs of high rank-width (Q1709595) (← links)
- Unit interval vertex deletion: fewer vertices are relevant (Q1747495) (← links)
- Vertex deletion problems on chordal graphs (Q1786595) (← links)
- Paths to trees and cacti (Q1998842) (← links)
- Incompressibility of \(H\)-free edge modification problems: towards a dichotomy (Q2071824) (← links)
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion (Q2149107) (← links)
- Vertex deletion into bipartite permutation graphs (Q2161007) (← links)
- Structural parameterizations with modulator oblivion (Q2161010) (← links)
- Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
- Algorithms for automatic ranking of participants and tasks in an anonymized contest (Q2272379) (← links)
- Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results (Q2297848) (← links)
- A polynomial kernel for block graph deletion (Q2408204) (← links)
- A cubic vertex-kernel for \textsc{Trivially Perfect Editing} (Q2696282) (← links)
- Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
- (Q5089163) (← links)
- (Q5126619) (← links)
- (Q5136298) (← links)
- Vertex Deletion Problems on Chordal Graphs (Q5136314) (← links)
- Chordless Cycle Packing Is Fixed-Parameter Tractable (Q5874543) (← links)
- (Q5874544) (← links)
- Conflict free version of covering problems on graphs: classical and parameterized (Q5918906) (← links)
- (Q6065472) (← links)
- Vertex deletion into bipartite permutation graphs (Q6068239) (← links)
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs (Q6084414) (← links)
- (Q6089666) (← links)
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes (Q6098156) (← links)
- Deletion to scattered graph classes. I: Case of finite number of graph classes (Q6133645) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams (Q6185609) (← links)
