Skip to main content
SpringerLink
Log in

A value for games on colored communication structures

  • Review
  • Published:
Operational Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • 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–250

  • Graf A, Stumpf M, Weienfels G (1998) On coloring unit disk graphs. Algorithmica 20(3):277–293

    Article  Google Scholar 

  • Leighton FT (1979) A graph coloring algorithm for large scheduling problems. J Res Natl Bur Stand 84:79–100

    Article  Google Scholar 

  • Mullot R (2006) Les documents écrits de la numérisation indexation par le contenu. Hermes science Publication, Editeur

  • Myerson RB (1977) Graphs and cooperation in games. Math Oper Res 2:225–229

    Article  Google Scholar 

  • Nishizeki T, Kashiwagi K (1990) On the 1:1 link-coloring multigraphs. SIAM J Discrete Math 3(3):391–410

    Article  Google 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–1206

  • 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–2704

  • 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–367

Download references

Acknowledgements

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

Author information

Author notes

  1. M. Ordóñez

    Present address: E.T.S.I. Applied Department of Mathematics, Universidad de Sevilla, 41092, Sevilla, Spain

Authors and Affiliations

  1. E.T.S.I. Applied Department of Mathematics, Universidad de Sevilla, 41092, Sevilla, Spain

    A. Jiménez-Losada & Julio Fernández

  2. Department of Didactics of Mathematics, Facultad de Ciencias de la Educación, Universidad de Sevilla, 41005, Sevilla, Spain

    Inés Gallego

Authors
  1. M. Ordóñez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Jiménez-Losada
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Julio Fernández
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Inés Gallego
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Ordóñez.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ordóñez, M., Jiménez-Losada, A., Fernández, J. et al. A value for games on colored communication structures. Oper Res Int J 21, 2247–2260 (2021). https://doi.org/10.1007/s12351-019-00535-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12351-019-00535-8

Keywords

Search

Navigation