A connection between circular colorings and periodic schedules

DOI10.1016/j.dam.2008.10.003zbMath1198.05072OpenAlexW1992171528MaRDI QIDQ1028150

Hong-Gwa Yeh

Publication date: 30 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.10.003

zbMATH Keywords

circular chromatic numberedge-weighted graphperiodic schedulingMinty's theoremtimed marked graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Deterministic scheduling theory in operations research (90B35) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Variational-Bayes optical flow

Cites Work

• Unnamed Item
• Unnamed Item
• A method to obtain lower bounds for circular chromatic number
• Homomorphisms to powers of digraphs
• Resource-sharing system scheduling and circular chromatic number
• Marked directed graphs
• Star chromatic number
• A Theorem on n-Coloring the Points of a Linear Graph
• Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
• On (k,d)-colorings and fractional nowhere-zero flows
• Circular colorings of edge-weighted graphs
• The circular chromatic number of a digraph
• Acyclic graph coloring and the complexity of the star chromatic number
• Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
• Scheduling Parallel Computations
• Circular chromatic number: A survey

This page was built for publication: A connection between circular colorings and periodic schedules