Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs (Q1917245): Difference between revisions

@@ Property / cites work @@
+Q3941433
@@ Property / cites work: Q3941433 / rank @@
+Normal rank
@@ Property / cites work @@
+Dominating sets and domatic number of circular arc graphs
+Normal rank
@@ Property / cites work @@
+Towards a theory of domination in graphs
@@ Property / cites work: Towards a theory of domination in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Coloring Circular Arcs and Chords
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for interval graphs and circular-arc graphs
+Normal rank
@@ Property / cites work @@
+The file distribution problem for processor networks
+Normal rank
@@ Property / cites work @@
+A polynomial time approximation algorithm for dynamic storage allocation
+Normal rank
@@ Property / cites work @@
+Q3950561
@@ Property / cites work: Q3950561 / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
+Normal rank
@@ Property / cites work @@
+Q3975168
@@ Property / cites work: Q3975168 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear algorithm for domatic number problem on interval graphs
+Normal rank
@@ Property / cites work @@
+Decomposing a set of points into chains, with applications to permutation and circle graphs
+Normal rank
@@ Property / cites work @@
+Coloring a Family of Circular Arcs
@@ Property / cites work: Coloring a Family of Circular Arcs / rank @@
+Normal rank