Balanced Paths in Colored Graphs
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infinite path where either (i) all colors occur with the same asymptotic frequency, or (ii) there is a constant which bounds the difference between the occurrences of any two colors for all prefixes of the path. These two notions can be viewed as refinements of the classical notion of fair path, whose simplest form checks whether all colors occur infinitely often. Our notions provide stronger criteria, particularly suitable for scheduling applications based on a coarse-grained model of the jobs involved. We show that both problems are solvable in polynomial time, by reducing them to the feasibility of a linear program.
KeywordsColored Graph Balance Problem Difference Vector Difference Path Maximum Modulus
Unable to display preview. Download preview PDF.
- [AH98]Alur, R., Henzinger, T.A.: Finitary fairness. ACM Trans. on Programming Languages and Systems 20(6) (1998)Google Scholar
- [dA00]de Alfaro, L.: From fairness to chance. ENTCS 22 (2000)Google Scholar
- [Wik09]Wikipedia. Crop rotation (2009), http://www.wikipedia.com