A value for games on colored communication structures
- 15 Downloads
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.
KeywordsEdge colored graphs Game theory Myerson value
This research has been partially supported by the FQM237 grant of the Andalusian Government.
- 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
- Mullot R (2006) Les documents écrits de la numérisation indexation par le contenu. Hermes science Publication, EditeurGoogle Scholar
- 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
- 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
- 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