The complexity of scheduling independent two-processor tasks on dedicated processors (Q1107984): Difference between revisions

@@ Property / cites work @@
+Scheduling independent 2-processor tasks to minimize schedule length
+Normal rank
@@ Property / cites work @@
+Scheduling Multiprocessor Tasks to Minimize Schedule Length
+Normal rank
@@ Property / cites work @@
+On Edge Coloring Bipartite Graphs
@@ Property / cites work: On Edge Coloring Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Q3971918
@@ Property / cites work: Q3971918 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear algorithms for edge-coloring trees and unicyclic graphs
+Normal rank
@@ Property / cites work @@
+Q3693539
@@ Property / cites work: Q3693539 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3325753
@@ Property / cites work: Q3325753 / rank @@
+Normal rank
@@ Property / cites work @@
+On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals
+Normal rank