An O(n^2) time algorithm for the minimal permutation completion problem
From MaRDI portal
An \(O(n^2)\) time algorithm for the minimal permutation completion problem
Recommendations
- An \(\mathcal {O}(n^2)\) time algorithm for the minimal permutation completion problem
- An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem
- An \({\mathcal{O}}(n^2)\)-time algorithm for the minimal interval completion problem
- Some Efficient Algorithms for Permutation Graphs
- Minimal Interval Completion Through Graph Exploration
Cites work
- scientific article; zbMATH DE number 3906240 (Why is no real title available?)
- A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithms – ESA 2005
- An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem
- An \(\mathcal {O}(n^2)\) time algorithm for the minimal permutation completion problem
- Characterizing and computing minimal cograph completions
- Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
- Computing the Minimum Fill-In is NP-Complete
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
- Minimal comparability completions of arbitrary graphs
- Minimal proper interval completions
- Minimal split completions
- Minimal triangulations of graphs: a survey
- NP-completeness results for edge modification problems
- On minimal augmentation of a graph to obtain an interval graph
Cited in
(4)
This page was built for publication: An \(O(n^2)\) time algorithm for the minimal permutation completion problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1720313)
