Modification to Planarity is Fixed Parameter Tractable
From MaRDI portal
Recommendations
Cites work
- (Meta) kernelization
- A near-optimal planarization algorithm
- Chordal deletion is fixed-parameter tractable
- Finding topological subgraphs is fixed-parameter tractable
- FPT algorithms for plane completion problems
- Graph minors. V. Excluding a planar graph
- Graph minors. XIII: The disjoint paths problem
- Hitting forbidden minors: approximation and kernelization
- scientific article; zbMATH DE number 5485559 (Why is no real title available?)
- Linear kernels for edge deletion problems to immersion-closed graph classes
- Obtaining a planar graph by vertex deletion
- Obtaining planarity by contracting few edges
- Odd cycle packing
- Optimal algorithms for hitting (topological) minors on graphs of bounded treewidth
- Parameterized algorithms
- Planarity Allowing Few Error Vertices in Linear Time
- The Induced Disjoint Paths Problem
- Tight bounds for linkages in planar graphs
Cited in
(11)- An algorithmic meta-theorem for graph modification to planarity and FOL
- Combing a Linkage in an Annulus
- A survey of parameterized algorithms and the complexity of edge modification
- A more accurate view of the flat wall theorem
- Computing paths of large rank in planar frameworks deterministically
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
- An FPT-algorithm for recognizing k-apices of minor-closed graph classes
- Vertex identification to a forest
- Computing paths of large rank in planar frameworks deterministically
- Compound logics for modification problems
- Graph modification of bounded size to minor-closed classes as fast as vertex deletion
This page was built for publication: Modification to Planarity is Fixed Parameter Tractable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090477)
