A linear time algorithm for finding all hinge vertices of a permutation graph (Q671396): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(96)00092-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2091437869
@@ Property / OpenAlex ID: W2091437869 / rank @@
+Normal rank
@@ Property / cites work @@
+Permutation Graphs and Transitive Graphs
@@ Property / cites work: Permutation Graphs and Transitive Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of strongly chordal graphs
@@ Property / cites work: Characterizations of strongly chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023519
@@ Property / cites work: Q4023519 / rank @@
+Normal rank
@@ Property / cites work @@
+Transitive Orientation of Graphs and Identification of                         Permutation Graphs
+Normal rank