Advertisement

A value for games on colored communication structures

  • M. OrdóñezEmail author
  • A. Jiménez-Losada
  • Julio Fernández
  • Inés Gallego
Review
  • 15 Downloads

Abstract

Colored graphs have been used in many areas of technological research such as computer science, multiprocessor systems, network topology, etc. Normally, the term colored graph is used in a graph where its nodes have been colored. However, we work with edge colored graphs, where the ones that have been colored are the edges. The main aim of this paper is to determine a way based on cooperative game theory to measure the importance of the nodes in a network using edge colored graphs.

Keywords

Edge colored graphs Game theory Myerson value 

Notes

Acknowledgements

This research has been partially supported by the FQM237 grant of the Andalusian Government.

References

  1. Burke EK, Newall J, Weare RF (1996) A memetic algorithm for university exam timetabling. In: Burke E, Ross P (eds) First international conference on practice and theory of automated timetabling, Edinburgh, UK, August/September 1995. Selected papers. Lecture notes in computer science, vol 1153, Springer-Verlag, Berlin, pp 241–250CrossRefGoogle Scholar
  2. Graf A, Stumpf M, Weienfels G (1998) On coloring unit disk graphs. Algorithmica 20(3):277–293CrossRefGoogle Scholar
  3. Leighton FT (1979) A graph coloring algorithm for large scheduling problems. J Res Natl Bur Stand 84:79–100CrossRefGoogle Scholar
  4. Mullot R (2006) Les documents écrits de la numérisation indexation par le contenu. Hermes science Publication, EditeurGoogle Scholar
  5. Myerson RB (1977) Graphs and cooperation in games. Math Oper Res 2:225–229CrossRefGoogle Scholar
  6. Nishizeki T, Kashiwagi K (1990) On the 1:1 link-coloring multigraphs. SIAM J Discrete Math 3(3):391–410CrossRefGoogle Scholar
  7. Terashima-Marn H, Ross P, Valenzuela-Rendón M (1996) Clique-based crossover for solving the timetabling problem with gas. In: Proceedings of the congress on evolutionary computation, pp 1200–1206Google Scholar
  8. Viard-Gaudin C, Barba D (1991) A multi-resolution approach to extract the address block on flat mail pieces. In: International conference ICASSP-91, vol 4, pp 2701–2704Google Scholar
  9. Wang CH, Palumbo PW, Srihari SN (1988) Object recognition in visually complex environments: an architecture for locating address blocks on mail pieces. In: 9th international conference on pattern recognition, vol 1. IEEE, pp 365–367Google Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

  1. 1.E.T.S.I. Applied Department of MathematicsUniversidad de SevillaSevillaSpain
  2. 2.Department of Didactics of Mathematics, Facultad de Ciencias de la EducaciónUniversidad de SevillaSevillaSpain

Personalised recommendations