On minimal augmentation of a graph to obtain an interval graph (Q1154281): Difference between revisions

@@ Property / cites work @@
+Q4773298
@@ Property / cites work: Q4773298 / rank @@
+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 @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+`` Strong '' NP-Completeness Results
@@ Property / cites work: `` Strong '' NP-Completeness Results / rank @@
+Normal rank
@@ Property / cites work @@
+A Characterization of Comparability Graphs and of Interval Graphs
+Normal rank
@@ Property / cites work @@
+Representation of a finite graph by a set of intervals on the real line
+Normal rank
@@ Property / cites work @@
+A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph
+Normal rank
@@ Property / cites work @@
+Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
+Normal rank
@@ Property / cites work @@
+One-dimensional logic gate assignment and interval graphs
+Normal rank
@@ Property / cites work @@
+Q4144192
@@ Property / cites work: Q4144192 / rank @@
+Normal rank
@@ Property / cites work @@
+Triangulated graphs and the elimination process
@@ Property / cites work: Triangulated graphs and the elimination process / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank