Advertisement

Balanced Paths in Colored Graphs

  • Alessandro Bianco
  • Marco Faella
  • Fabio Mogavero
  • Aniello Murano
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5734)

Abstract

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.

Keywords

Colored Graph Balance Problem Difference Vector Difference Path Maximum Modulus 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AH98]
    Alur, R., Henzinger, T.A.: Finitary fairness. ACM Trans. on Programming Languages and Systems 20(6) (1998)Google Scholar
  2. [CLRS01]
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)zbMATHGoogle Scholar
  3. [dA00]
    de Alfaro, L.: From fairness to chance. ENTCS 22 (2000)Google Scholar
  4. [DJP03]
    Dershowitz, N., Jayasimha, D.N., Park, S.: Bounded fairness. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol. 2772, pp. 304–317. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  5. [Fra86]
    Francez, N.: Fairness. Springer, Heidelberg (1986)CrossRefzbMATHGoogle Scholar
  6. [Kwi89]
    Kwiatkowska, M.: Survey of fairness notions. Information and Software Technology 31(7), 371–386 (1989)CrossRefGoogle Scholar
  7. [LPS81]
    Lehmann, D., Pnueli, A., Stavi, J.: Impartiality, justice and fairness: The ethics of concurrent termination. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 264–277. Springer, Heidelberg (1981)CrossRefGoogle Scholar
  8. [MP91]
    Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, Heidelberg (1991)zbMATHGoogle Scholar
  9. [NW88]
    Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley-Interscience, Hoboken (1988)CrossRefzbMATHGoogle Scholar
  10. [Par66]
    Parikh, R.J.: On Context-Free Languages. Journal of the ACM 13(4), 570–581 (1966)MathSciNetCrossRefzbMATHGoogle Scholar
  11. [Wik09]
    Wikipedia. Crop rotation (2009), http://www.wikipedia.com

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Alessandro Bianco
    • 1
  • Marco Faella
    • 1
  • Fabio Mogavero
    • 1
  • Aniello Murano
    • 1
  1. 1.Università degli Studi di Napoli “Federico II”Italy

Personalised recommendations