Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Mónica Braga"'
Autor:
Mónica Braga, Javier Marenco
Publikováno v:
RAIRO - Operations Research. 54:1863-1874
A coloring of a graph is an assignment of colors to its vertices such that any two vertices receive distinct colors whenever they are adjacent. An acyclic coloring is a coloring such that no cycle receives exactly two colors, and the acyclic chromati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9095c13bba1e21be6c59db10dbcd37c7
https://doi.org/10.1051/ro/2019098
https://doi.org/10.1051/ro/2019098
Autor:
María del Carmen Varaldo, Maria E. Ugarte, Mónica Braga, Mariana S. Escalante, Javier Marenco, Diego Delle Donne
Publikováno v:
Discrete Applied Mathematics. 281:69-80
In this paper we define a generalization of the classical vertex coloring problem of a graph, where some pairs of adjacent vertices can be assigned to the same color. We call weak an edge connecting two such vertices. We look for a coloring of the gr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ffda1488a726158729e879e27a4953b9
https://doi.org/10.1016/j.dam.2019.05.010
https://doi.org/10.1016/j.dam.2019.05.010
Autor:
Mónica Braga, Javier Marenco
Publikováno v:
LAGOS
Given two graphs G = (V, EG) and H = (V, EH) over the same set of vertices and given a set of colors C, the impact on H of a coloring c : V → C of G, denoted I ( c ) , is the number of edges ij ∈ EH such that c(i) = c(j). In this setting, the max
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b09c7ee2cd4fed570902fb7dd50c505a
https://doi.org/10.1016/j.entcs.2019.08.018
https://doi.org/10.1016/j.entcs.2019.08.018
Autor:
Mónica Braga, María del Carmen Varaldo, Diego Delle Donne, Mariana S. Escalante, Javier Marenco, Maria E. Ugarte
Publikováno v:
Electronic Notes in Discrete Mathematics. 62:309-314
We propose a generalization of the k-coloring problem, namely the minimum chromatic violation problem (MCVP). Given a graph G = ( V , E ) , a set of weak edges F ⊂ E and a set of colors C , the MCVP asks for a | C | -coloring of the graph G ′ = (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e53c715d5966caabcb63e94ff1cac3b
https://doi.org/10.1016/j.endm.2017.10.053
https://doi.org/10.1016/j.endm.2017.10.053
Autor:
Javier Marenco, Mónica Braga
Publikováno v:
RAIRO - Operations Research. 50:627-644
In a previous work we presented six facet-inducing families of valid inequalities for the polytope associated to an integer programming formulation of the acyclic coloring problem. In this work we study their disjunctive rank, as defined by [E. Balas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b18fa6d4cd61e366055447f81f140353
https://doi.org/10.1051/ro/2015053
https://doi.org/10.1051/ro/2015053
Publikováno v:
International Transactions in Operational Research. 24:303-324
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ac81e219adbf6b951c42c65460c937c
https://doi.org/10.1111/itor.12265
https://doi.org/10.1111/itor.12265
Publikováno v:
Discrete Applied Mathematics. 160:2606-2617
A coloring of a graph G is an assignment of colors to the vertices of G such that any two vertices receive distinct colors whenever they are adjacent. An acyclic coloring of G is a coloring such that no cycle of G receives exactly two colors, and the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5a2f4a31d89de74555fb5a757a9b1e73
https://doi.org/10.1016/j.dam.2012.03.005
https://doi.org/10.1016/j.dam.2012.03.005
Autor:
Mónica Braga, Javier Marenco
Publikováno v:
Electronic Notes in Discrete Mathematics. 35:35-40
A coloring of a graph G is an assignment of colors to the vertices of G such that any two vertices receive distinct colors whenever they are adjacent. An acyclic coloring of G is a coloring such that no cycle of G receives exactly two colors, and the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f75f6910102667e32af284d1488193db
https://doi.org/10.1016/j.endm.2009.11.007
https://doi.org/10.1016/j.endm.2009.11.007
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Braga, Mónica1 mbraga@ungs.edu.ar, Delle Donne, Diego1 ddelledo@ungs.edu.ar, Linfati, Rodrigo2 rlinfati@ubiobio.cl, Marenco, Javier1 jmarenco@ungs.edu.ar
Publikováno v:
International Transactions in Operational Research. Jan-Mar2017, Vol. 24 Issue 1/2, p303-324. 22p. 1 Illustration, 6 Diagrams, 4 Charts.