Pages that link to "Item:Q2827805"
From MaRDI portal
The following pages link to An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem (Q2827805):
Displaying 5 items.
- On the effectiveness of the incremental approach to minimal chordal edge modification (Q820555) (← links)
- An \(O(n^2)\) time algorithm for the minimal permutation completion problem (Q1720313) (← links)
- Solving static permutation mastermind using \(O(n \log n)\) queries (Q2073315) (← links)
- Solving a permutation problem by a fully polynomial-time approximation scheme (Q3000079) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)