Linear algorithm for optimal path cover problem on interval graphs (Q911770): Difference between revisions

@@ Property / cites work @@
+Q4052166
@@ Property / cites work: Q4052166 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum node disjoint path covering for circular-arc graphs
+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 @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4050641
@@ Property / cites work: Q4050641 / rank @@
+Normal rank
@@ Property / cites work @@
+Advances on the Hamiltonian Completion Problem
@@ Property / cites work: Advances on the Hamiltonian Completion Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Hamiltonian circuits in interval graphs
@@ Property / cites work: Finding Hamiltonian circuits in interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals
+Normal rank
@@ Property / cites work @@
+A unified approach to domination problems on interval graphs
+Normal rank
@@ Property / cites work @@
+Linear algorithm for domatic number problem on interval graphs
+Normal rank