Resource-sharing system scheduling and circular chromatic number

DOI10.1016/j.tcs.2004.12.005zbMath1088.68144OpenAlexW2023012701MaRDI QIDQ1770401

Xuding Zhu, Hong-Gwa Yeh

Publication date: 6 April 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.12.005

zbMATH Keywords

SchedulingFairnessHomomorphismCircular chromatic numberFractional chromatic numberMinimum mean cycleScheduling by edge reversal

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

THE PROPORTIONAL COLORING PROBLEM: OPTIMIZING BUFFERS IN RADIO MESH NETWORKS ⋮ Circular coloring of graphs via linear programming and tabu search ⋮ Resource-sharing systems and hypergraph colorings ⋮ Interleaved adjoints of directed graphs ⋮ A connection between circular colorings and periodic schedules ⋮ The circular chromatic number of hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A lower bound on the period length of a distributed scheduler
• Kneser's conjecture, chromatic number, and homotopy
• Some aspects of parallel and distributed iterative algorithms - a survey
• Graph coloring in linear time
• On the complexity of H-coloring
• A characterization of the minimum cycle mean in a digraph
• The use of a synchronizer yields the maximum computation rate in distributed networks
• The interleaved multichromatic number of a graph
• Circular chromatic number of Kneser graphs
• On the fractional chromatic number, the chromatic number, and graph products
• Circular colouring and orientation of graphs
• Star chromatic numbers of graphs
• An analogue of Hajós’ Theorem for the circular chromatic number
• On directed local chromatic number, shift graphs, and Borsuk-like graphs
• A note on the star chromatic number
• Star chromatic number
• Star chromatic numbers and products of graphs
• The star chromatic number of a graph
• On (k,d)-colorings and fractional nowhere-zero flows
• Circular colouring and graph homomorphism
• Multichromatic numbers, star chromatic numbers and Kneser graphs
• Acyclic graph coloring and the complexity of the star chromatic number
• Sharing resources at nonuniform access rates
• Circular chromatic number: A survey

This page was built for publication: Resource-sharing system scheduling and circular chromatic number