@article{49f4363776304b7b9049866449a45edc,

title = "Resource-sharing system scheduling and circular chromatic number",

abstract = "Circular chromatic number and scheduling for a resource-sharing system was studied. It was proved that the rate of an optimal strongly fair scheduling of a graph G is equal to the reciprocal of the circular chromatic number of G. The rate of an optimal weakly fair scheduling of G was proved to be equal to the reciprocal of the fractional chromatic number of g. In the study of circular chromatic number, the target graph for the interleaved p-color, q-tuple coloring and the target graph of Bondy and Hell defined (p, q)-coloring were found to be homomorphically equivalent.",

keywords = "Circular chromatic number, Fairness, Fractional chromatic number, Homomorphism, Minimum mean cycle, Scheduling, Scheduling by edge reversal",

author = "Yeh, {Hong Gwa} and Xuding Zhu",

note = "Funding Information: ∗Corresponding author. E-mail address: hgyeh@math.ncu.edu.tw (H.-G. Yeh). 1Partially supported by the National Science Council of R.O.C. under grant NSC91-2115-M-008-013. 2Partially supported by the National Science Council of R.O.C. under grant NSC92-2115-M-110-007.",

year = "2005",

month = feb,

day = "28",

doi = "10.1016/j.tcs.2004.12.005",

language = "???core.languages.en_GB???",

volume = "332",

pages = "447--460",

journal = "Theoretical Computer Science",

issn = "0304-3975",

number = "1-3",

}