Abstract
This note summarizes the main results presented in the author's Ph.D. thesis, supervised by Professor Michel Van Caneghem and defended on 14th June 2005 at University of Aix-Marseille II, France. The thesis, written in French, is available at http: //www.lif-sud.univ-mrs.fr/Rapports/25-2005.html. The mutual exclusion scheduling problem has an elegant graph-theoretic formulation: given an undirected graph G and an integer k, find a minimum coloring of G such that each color appears at most k times. When G is an interval graph, this problem has some applications in workforce planning. Then, the object of the thesis is to study the complexity of mutual exclusion scheduling problem for interval graphs and related classes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
