A Subexponential Parameterized Algorithm for Proper Interval Completion
From MaRDI portal
(Redirected from Publication:5899484)
Recommendations
- A subexponential parameterized algorithm for proper interval completion
- Subexponential parameterized algorithm for interval completion
- Subexponential parameterized algorithm for {\textsc{Interval Completion}}
- Interval Completion Is Fixed Parameter Tractable
- A new fully polynomial time approximation scheme for the interval subset sum problem
- An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem
- Exploring subexponential parameterized complexity of completion problems
- An \({\mathcal{O}}(n^2)\)-time algorithm for the minimal interval completion problem
- Subexponential parameterized algorithm for minimum fill-in
- scientific article; zbMATH DE number 7053390
Cites work
- A subexponential parameterized algorithm for proper interval completion
- An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs
- Computing the Minimum Fill-In is NP-Complete
- Exploring subexponential parameterized complexity of completion problems
- Fast FAST
- Faster parameterized algorithms for deletion to split graphs
- Fixed-parameter tractability of graph modification problems for hereditary properties
- scientific article; zbMATH DE number 1617243 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- Interval Completion Is Fixed Parameter Tractable
- Optimal greedy algorithms for indifference graphs
- Polynomial kernels for proper interval completion and related problems
- Subexponential parameterized algorithm for minimum fill-in
- Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
- Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
- Two edge modification problems without polynomial kernels
- Which problems have strongly exponential complexity?
Cited in
(18)- Paths to trees and cacti
- Polynomial kernelization for removing induced claws and diamonds
- A cubic vertex-kernel for \textsc{Trivially Perfect Editing}
- Polynomial kernels for proper interval completion and related problems
- Interval Completion Is Fixed Parameter Tractable
- Polynomial kernels for proper interval completion and related problems
- Subexponential parameterized algorithm for {\textsc{Interval Completion}}
- Subexponential parameterized algorithm for interval completion
- Approximation and kernelization for chordal vertex deletion
- Paths to trees and cacti
- Slightly superexponential parameterized problems
- A subexponential parameterized algorithm for proper interval completion
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
- A survey of parameterized algorithms and the complexity of edge modification
- On the proper interval completion problem within some chordal subclasses
- Parameterized complexity of biclique contraction and balanced biclique contraction
- Rank reduction of oriented graphs by vertex and edge deletions
- Parameterized dynamic data structure for split completion
This page was built for publication: A Subexponential Parameterized Algorithm for Proper Interval Completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899484)
