IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v39y2020i3d10.1007_s10878-020-00528-w.html
   My bibliography  Save this article

Contrast in greyscales of graphs

Author

Listed:
  • Natalia Castro

    (Universidad de Sevilla)

  • María A. Garrido-Vizuete

    (Universidad de Sevilla)

  • Rafael Robles

    (Universidad de Sevilla)

  • María Trinidad Villar-Liñán

    (Universidad de Sevilla)

Abstract

In this paper, we present the notion of greyscale of a graph, as a colouring of its vertices that uses colours from the continuous spectrum [0, 1]. Any greyscale induces another colouring by assigning to each edge the non-negative difference between the colours of its vertices. These edge colours are ordered in lexicographical increasing order and make up the contrast vector of the greyscale. The aim of the contrast problem for the given graph is to find the maximum contrast vector and the greyscales that give rise to it, namely the maximum contrast greyscales. The NP-completeness of this problem is stated by means of a functional relation between the chromatic number and the first component of the maximum contrast vector, named the lightest tone. Thus, we introduce the notion of lightest tone as a new invariant of the graph. The underlying structure of values of maximum contrast greyscales is addressed and we prove that they are linked by rational number sets, which are algorithmically determined. The restricted maximum contrast problem, that is, greyscales with prefixed extreme tones, is also defined and solved in polynomial time for different families of bipartite graphs.

Suggested Citation

  • Natalia Castro & María A. Garrido-Vizuete & Rafael Robles & María Trinidad Villar-Liñán, 2020. "Contrast in greyscales of graphs," Journal of Combinatorial Optimization, Springer, vol. 39(3), pages 874-898, April.
    • Handle: RePEc:spr:jcomop:v:39:y:2020:i:3:d:10.1007_s10878-020-00528-w
    DOI: 10.1007/s10878-020-00528-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-020-00528-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-020-00528-w?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Chinneck, John W. & Hafez, Roshdy H.M., 2016. "Fast heuristics for the frequency channel assignment problem in multi-hop wireless networksAuthor-Name: Chaudhry, Aizaz U," European Journal of Operational Research, Elsevier, vol. 251(3), pages 771-782.
    2. Demange, Marc & Ekim, Tınaz & Ries, Bernard & Tanasescu, Cerasela, 2015. "On some applications of the selective graph coloring problem," European Journal of Operational Research, Elsevier, vol. 240(2), pages 307-314.
    3. Karen Aardal & Stan Hoesel & Arie Koster & Carlo Mannino & Antonio Sassano, 2007. "Models and solution techniques for frequency assignment problems," Annals of Operations Research, Springer, vol. 153(1), pages 79-129, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chung, Yerim & Culus, Jean-François & Demange, Marc, 2015. "Inverse chromatic number problems in interval and permutation graphs," European Journal of Operational Research, Elsevier, vol. 243(3), pages 763-773.
    2. Jamie Fairbrother & Adam N. Letchford & Keith Briggs, 2018. "A two-level graph partitioning problem arising in mobile wireless communications," Computational Optimization and Applications, Springer, vol. 69(3), pages 653-676, April.
    3. Pop, Petrică C., 2020. "The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances," European Journal of Operational Research, Elsevier, vol. 283(1), pages 1-15.
    4. Dupont, Audrey & Linhares, Andréa Carneiro & Artigues, Christian & Feillet, Dominique & Michelon, Philippe & Vasquez, Michel, 2009. "The dynamic frequency assignment problem," European Journal of Operational Research, Elsevier, vol. 195(1), pages 75-88, May.
    5. Bradley Hardy & Rhyd Lewis & Jonathan Thompson, 2018. "Tackling the edge dynamic graph colouring problem with and without future adjacency information," Journal of Heuristics, Springer, vol. 24(3), pages 321-343, June.
    6. Hawa, Asyl L. & Lewis, Rhyd & Thompson, Jonathan M., 2022. "Exact and approximate methods for the score-constrained packing problem," European Journal of Operational Research, Elsevier, vol. 302(3), pages 847-859.
    7. Francesco Carrabs & Raffaele Cerulli & Ciriaco D’Ambrosio & Federica Laureana, 2021. "The Generalized Minimum Branch Vertices Problem: Properties and Polyhedral Analysis," Journal of Optimization Theory and Applications, Springer, vol. 188(2), pages 356-377, February.
    8. Kata Kiatmanaroj & Christian Artigues & Laurent Houssin & Frédéric Messine, 2013. "Frequency assignment in a SDMA satellite communication system with beam decentring feature," Computational Optimization and Applications, Springer, vol. 56(2), pages 439-455, October.
    9. Jaka Kranjc & Borut Lužar & Martina Mockovčiaková & Roman Soták, 2014. "Note on coloring of double disk graphs," Journal of Global Optimization, Springer, vol. 60(4), pages 793-799, December.
    10. Péter Madarasi, 2021. "Matchings under distance constraints I," Annals of Operations Research, Springer, vol. 305(1), pages 137-161, October.
    11. Tınaz Ekim & Mordechai Shalom & Oylum Şeker, 2021. "The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation," Journal of Combinatorial Optimization, Springer, vol. 41(3), pages 710-735, April.
    12. Bozorgi, Ali, 2016. "Multi-product inventory model for cold items with cost and emission consideration," International Journal of Production Economics, Elsevier, vol. 176(C), pages 123-142.
    13. Fabrizio Borghini & Isabel Méndez-Díaz & Paula Zabala, 2020. "An exact algorithm for the edge coloring by total labeling problem," Annals of Operations Research, Springer, vol. 286(1), pages 11-31, March.
    14. Raja Marappan & Gopalakrishnan Sethumadhavan, 2020. "Complexity Analysis and Stochastic Convergence of Some Well-known Evolutionary Operators for Solving Graph Coloring Problem," Mathematics, MDPI, vol. 8(3), pages 1-20, February.
    15. Edmund Burke & Jakub Mareček & Andrew Parkes & Hana Rudová, 2010. "A supernodal formulation of vertex colouring with applications in course timetabling," Annals of Operations Research, Springer, vol. 179(1), pages 105-130, September.
    16. Ferrarini, Luca & Gualandi, Stefano, 2022. "Total Coloring and Total Matching: Polyhedra and Facets," European Journal of Operational Research, Elsevier, vol. 303(1), pages 129-142.
    17. Carlos-Iván Páez-Rueda & Arturo Fajardo & Manuel Pérez & German Yamhure & Gabriel Perilla, 2023. "The F/DR-D-10 Algorithm: A Novel Heuristic Strategy to Solve the Minimum Span Frequency Assignment Problem Embedded in Mobile Applications," Mathematics, MDPI, vol. 11(20), pages 1-14, October.
    18. Chinneck, John W. & Hafez, Roshdy H.M., 2016. "Fast heuristics for the frequency channel assignment problem in multi-hop wireless networksAuthor-Name: Chaudhry, Aizaz U," European Journal of Operational Research, Elsevier, vol. 251(3), pages 771-782.
    19. Şeker, Oylum & Ekim, Tınaz & Taşkın, Z. Caner, 2021. "An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs," European Journal of Operational Research, Elsevier, vol. 291(1), pages 67-83.
    20. Simon Thevenin & Nicolas Zufferey & Jean-Yves Potvin, 2017. "Makespan minimisation for a parallel machine scheduling problem with preemption and job incompatibility," International Journal of Production Research, Taylor & Francis Journals, vol. 55(6), pages 1588-1606, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:39:y:2020:i:3:d:10.1007_s10878-020-00528-w. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.