Mutual exclusion scheduling (Q1365931): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A spectral technique for coloring random 3-colorable graphs (preliminary version)
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. I: Discharging
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+A better performance guarantee for approximate graph coloring
+Normal rank
@@ Property / cites work @@
+Q4326697
@@ Property / cites work: Q4326697 / rank @@
+Normal rank
@@ Property / cites work @@
+Restrictions of graph partition problems. I
@@ Property / cites work: Restrictions of graph partition problems. I / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling with incompatible jobs
@@ Property / cites work: Scheduling with incompatible jobs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4694722
@@ Property / cites work: Q4694722 / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+Normal rank
@@ Property / cites work @@
+An upper bound for the chromatic number of a graph and its application to timetabling problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1365931