Minimal comparability completions of arbitrary graphs (Q2476257): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2007.08.039
+Normal rank
@@ Property / OpenAlex ID @@
+W2123268636
@@ Property / OpenAlex ID: W2123268636 / rank @@
+Normal rank
@@ Property / cites work @@
+A vertex incremental approach for maintaining chordality
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Orienting graphs to optimize reachability
@@ Property / cites work: Orienting graphs to optimize reachability / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal Split Completions of Graphs
@@ Property / cites work: Minimal Split Completions of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921757
@@ Property / cites work: Q2921757 / rank @@
+Normal rank
@@ Property / cites work @@
+Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
+Normal rank
@@ Property / cites work @@
+Q4471361
@@ Property / cites work: Q4471361 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal fill in O(\(n^{2.69}\)) time
@@ Property / cites work: Minimal fill in O(\(n^{2.69}\)) time / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity classification of some edge modification problems
+Normal rank
@@ Property / cites work @@
+Minimal Proper Interval Completions
@@ Property / cites work: Minimal Proper Interval Completions / rank @@
+Normal rank
@@ Property / cites work @@
+Q3898496
@@ Property / cites work: Q3898496 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+On Comparability and Permutation Graphs
@@ Property / cites work: On Comparability and Permutation Graphs / 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