Linear-time minimal cograph editing
From MaRDI portal
Publication:2140496
Cites work
- A Linear Recognition Algorithm for Cographs
- An \(O(n^2)\) time algorithm for the minimal permutation completion problem
- An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem
- Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes
- Characterizing and computing minimal cograph completions
- Cluster editing
- Cograph editing: Merging modules is equivalent to editing P_4s
- Complement reducible graphs
- Complexity and parameterized algorithms for cograph editing
- Complexity of Finding Embeddings in a k-Tree
- Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
- Defining and identifying cograph communities in complex networks
- Exact algorithms for cluster editing: Evaluation and experiments
- Fast quasi-threshold editing
- Fully dynamic recognition algorithm and certificate for directed cographs
- Mapping the genome
- Minimal comparability completions of arbitrary graphs
- Minimal proper interval completions
- Minimal split completions
- On minimal augmentation of a graph to obtain an interval graph
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- Subexponential parameterized algorithm for interval completion
Cited in
(2)
This page was built for publication: Linear-time minimal cograph editing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140496)