Algorithms for interval catch digraphs (Q1329814): Difference between revisions

@@ Property / cites work @@
+An efficient algorithm for finding a two-pair, and its applications
+Normal rank
@@ Property / cites work @@
+Q3822191
@@ Property / cites work: Q3822191 / 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 @@
+On kernels and semikernels of digraphs
@@ Property / cites work: On kernels and semikernels of digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimizing weakly triangulated graphs
@@ Property / cites work: Optimizing weakly triangulated graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A digraph represented by a family of boxes or spheres
+Normal rank
@@ Property / cites work @@
+A characterization of interval catch digraphs
@@ Property / cites work: A characterization of interval catch digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Interval digraphs: An analogue of interval graphs
@@ Property / cites work: Interval digraphs: An analogue of interval graphs / rank @@
+Normal rank