论文信息 - Mutual Exclusion Scheduling - 字舞流文

Mutual Exclusion Scheduling

Edward G. Coffman | Brenda S. Baker | E. Coffman | B. Baker

[1] D. J. A. Welsh,et al. An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..

[2] Frank Harary,et al. Graph Theory , 2016 .

[3] K. Appel,et al. Every planar map is four colorable. Part I: Discharging , 1977 .

[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5] Brenda S. Baker,et al. Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[6] Zbigniew Lonc,et al. On Complexity of Some Chain and Antichain Partition Problems , 1991, WG.

[7] Klaus Jansen,et al. Scheduling with Incompatible Jobs , 1992, Discret. Appl. Math..

[8] H. Bodlaender,et al. Restrictions of Graph Partition Problems , 1993 .

[9] Petter E. Bjørstad,et al. Parallel Domain Decomposition Applied to Coupled Transport Equations , 1993 .

[10] Carsten Lund,et al. On the hardness of approximating minimization problems , 1994, JACM.

[11] J. Périaux,et al. Domain Decomposition Methods in Science and Engineering , 1994 .

[12] D. Welsh,et al. A Spectral Technique for Coloring Random 3-Colorable Graphs , 1994 .

[13] Klaus Jansen,et al. Restrictions of Graph Partition Problems. Part I , 1995, Theor. Comput. Sci..