Linear-time minimal cograph editing
From MaRDI portal
Publication:2140496
DOI10.1007/978-3-030-86593-1_12OpenAlexW3199287546MaRDI QIDQ2140496FDOQ2140496
Authors: Christophe Crespelle 
Publication date: 20 May 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-86593-1_12
Cites Work
- Cluster editing
- Complement reducible graphs
- Complexity of Finding Embeddings in a k-Tree
- Mapping the genome
- A Linear Recognition Algorithm for Cographs
- Fully dynamic recognition algorithm and certificate for directed cographs
- On minimal augmentation of a graph to obtain an interval graph
- Minimal comparability completions of arbitrary graphs
- An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem
- Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
- Minimal proper interval completions
- Minimal split completions
- Exact algorithms for cluster editing: Evaluation and experiments
- Subexponential parameterized algorithm for interval completion
- Complexity and parameterized algorithms for cograph editing
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- Defining and identifying cograph communities in complex networks
- Fast quasi-threshold editing
- Characterizing and computing minimal cograph completions
- Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes
- An \(O(n^2)\) time algorithm for the minimal permutation completion problem
- Cograph editing: Merging modules is equivalent to editing P_4s
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)
