Resource-sharing system scheduling and circular chromatic number-Reference-Cited by-同舟云学术

Resource-sharing system scheduling and circular chromatic number

Published:2005-02 Issue:1-3 Volume:332 Page:447-460
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Yeh Hong-Gwa,Zhu Xuding

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference34 articles.

1. The star chromatic number of a graph;Abbott;J. Graph Theory,1993

2. V.C. Barbosa, Concurrency in systems with neighborhood constraints, Ph.D. Dissertation, Computer Science Department, University of California, Los Angeles, 1986.

3. The interleaved multichromatic number of a graph;Barbosa;Ann. Combin.,2002

4. V.C. Barbosa, M.R.F. Benevides, F.M.G. França, Sharing resources at nonuniform access rates, Theory of Comput. Syst. 34 (2001) 13–26.

5. Concurrency in systems with neighborhood constraints;Barbosa,1987

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Circular coloring of graphs via linear programming and tabu search;Central European Journal of Operations Research;2014-03-13

2. Randomized Self-stabilization under Distributed Daemon for 6-Coloring Planar Graph;Advances in Intelligent Systems and Applications - Volume 1;2013

3. THE PROPORTIONAL COLORING PROBLEM: OPTIMIZING BUFFERS IN RADIO MESH NETWORKS;Discrete Mathematics, Algorithms and Applications;2012-08-06

4. Scheduling links for heavy traffic on interfering routes in wireless mesh networks;Computer Networks;2012-03

5. Interleaved adjoints of directed graphs;European Journal of Combinatorics;2011-10