An $\mathcal O(n^2)$-time algorithm for the minimal interval completion problem (Q391090): Difference between revisions

@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+Fully Dynamic Representations of Interval Graphs
@@ Property / cites work: Fully Dynamic Representations of Interval Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An ${\mathcal{O}}(n^2)$ -time Algorithm for the Minimal Interval Completion Problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A Characterization of Comparability Graphs and of Interval Graphs
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal triangulations of graphs: a survey
@@ Property / cites work: Minimal triangulations of graphs: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal split completions
@@ Property / cites work: Minimal split completions / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal comparability completions of arbitrary graphs
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
+Normal rank
@@ Property / cites work @@
+Mapping the genome
@@ Property / cites work: Mapping the genome / rank @@
+Normal rank
@@ Property / cites work @@
+Incidence matrices, interval graphs and seriation in archeology
+Normal rank
@@ Property / cites work @@
+An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
+Normal rank
@@ Property / cites work @@
+Q3683903
@@ Property / cites work: Q3683903 / rank @@
+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
@@ Property / cites work @@
+Minimal interval completion through graph exploration
+Normal rank
@@ Property / cites work @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank

An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem (Q391090): Difference between revisions

Revision as of 04:43, 7 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)