On the effectiveness of the incremental approach to minimal chordal edge modification (Q820555): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2021.07.013
@@ Property / DOI: 10.1016/j.tcs.2021.07.013 / rank @@
-Normal rank
@@ Property / cites work @@
+Fast Quasi-Threshold Editing
@@ Property / cites work: Fast Quasi-Threshold Editing / rank @@
+Normal rank
@@ Property / cites work @@
+Defining and identifying cograph communities in complex networks
+Normal rank
@@ Property / cites work @@
+On the threshold of intractability
@@ Property / cites work: On the threshold of intractability / rank @@
+Normal rank
@@ Property / cites work @@
+Cluster graph modification problems
@@ Property / cites work: Cluster graph modification problems / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability of graph modification problems for hereditary properties
+Normal rank
@@ Property / cites work @@
+Error compensation in leaf power problems
@@ Property / cites work: Error compensation in leaf power problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
+Normal rank
@@ Property / cites work @@
+Interval Completion Is Fixed Parameter Tractable
@@ Property / cites work: Interval Completion Is Fixed Parameter Tractable / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
+Normal rank
@@ Property / cites work @@
+On minimal augmentation of a graph to obtain an interval graph
+Normal rank
@@ Property / cites work @@
+A vertex incremental approach for maintaining chordality
+Normal rank
@@ Property / cites work @@
+Faster and enhanced inclusion-minimal cograph completion
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal comparability completions of arbitrary graphs
+Normal rank
@@ Property / cites work @@
+Dynamically maintaining split graphs
@@ Property / cites work: Dynamically maintaining split graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal interval completion through graph exploration
+Normal rank
@@ Property / cites work @@
+Characterizing and computing minimal cograph completions
+Normal rank
@@ Property / cites work @@
+An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem
+Normal rank
@@ Property / cites work @@
+An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem
+Normal rank
@@ Property / cites work @@
+Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs
+Normal rank
@@ Property / cites work @@
+Inapproximability of Treewidth and Related Problems
+Normal rank
@@ Property / cites work @@
+Complexity classification of some edge modification problems
+Normal rank
@@ Property / cites work @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2021.07.013
@@ Property / DOI: 10.1016/J.TCS.2021.07.013 / rank @@
+Normal rank