Linear-time minimal cograph editing (Q2140496): Difference between revisions

@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Subexponential parameterized algorithm for Interval Completion
+Normal rank
@@ Property / cites work @@
+Cluster Editing
@@ Property / cites work: Cluster Editing / rank @@
+Normal rank
@@ Property / cites work @@
+Exact algorithms for cluster editing: Evaluation and experiments
+Normal rank
@@ Property / cites work @@
+Fast Quasi-Threshold Editing
@@ Property / cites work: Fast Quasi-Threshold Editing / rank @@
+Normal rank
@@ Property / cites work @@
+Unit interval editing is fixed-parameter tractable
+Normal rank
@@ Property / cites work @@
+Complement reducible graphs
@@ Property / cites work: Complement reducible graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Recognition Algorithm for Cographs
@@ Property / cites work: A Linear Recognition Algorithm for Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Fully dynamic recognition algorithm and certificate for directed cographs
+Normal rank
@@ Property / cites work @@
+Faster and enhanced inclusion-minimal cograph completion
+Normal rank
@@ Property / cites work @@
+An \(O(n^2)\) time algorithm for the minimal permutation completion problem
+Normal rank
@@ Property / cites work @@
+An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem
+Normal rank
@@ Property / cites work @@
+On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
+Normal rank
@@ Property / cites work @@
+Minimal comparability completions of arbitrary graphs
+Normal rank
@@ Property / cites work @@
+Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
+Normal rank
@@ Property / cites work @@
+Minimal split completions
@@ Property / cites work: Minimal split completions / rank @@
+Normal rank
@@ Property / cites work @@
+Cograph editing: Merging modules is equivalent to editing P_4s
+Normal rank
@@ Property / cites work @@
+Defining and identifying cograph communities in complex networks
+Normal rank
@@ Property / cites work @@
+Mapping the genome
@@ Property / cites work: Mapping the genome / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity and parameterized algorithms for cograph editing
+Normal rank
@@ Property / cites work @@
+Characterizing and computing minimal cograph completions
+Normal rank
@@ Property / cites work @@
+BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES
+Normal rank
@@ Property / cites work @@
+On minimal augmentation of a graph to obtain an interval graph
+Normal rank
@@ Property / cites work @@
+Minimal proper interval completions
@@ Property / cites work: Minimal proper interval completions / rank @@
+Normal rank