Zobrazeno 1 - 10
of 11
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
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
Autor:
Andrea González‐Domínguez, José Ignacio Cristobal‐Verdejo, Clara López‐Espinar, Sergio Fontela‐González, Sergio Vázquez, Javier Justo‐Domínguez, Jonatan González‐Caramazana, Mónica Bragado‐Cuesta, Alicia Álvarez‐Punzano, Vicente J. Herrería‐Bustillo
Publikováno v:
Journal of Veterinary Internal Medicine, Vol 38, Iss 1, Pp 161-166 (2024)
Abstract Background The utility of neutrophil‐to‐lymphocyte ratio (NLR), platelet to‐lymphocyte ratio (PLR) and monocyte‐to‐lymphocyte ratio (MLR) as prognostic indicators has not been investigated in canine parvovirosis (CPV). Hypothesis T
Externí odkaz:
https://doaj.org/article/4807e7a8367647ba98a96c772d5b1cfe
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
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 ′ = (
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
Publikováno v:
International Transactions in Operational Research. 24:303-324
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
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
Autor:
Bianca Lima Ferreira, Mônica Bragança Sousa, Giuseppe Gianini Figueirêdo Leite, Milena Karina Colo Brunialti, Erika Sayuri Nishiduka, Alexandre Keiji Tashima, Tom van der Poll, Reinaldo Salomão
Publikováno v:
Frontiers in Immunology, Vol 13 (2022)
Metabolic adaptations shape immune cell function. In the acute response, a metabolic switch towards glycolysis is necessary for mounting a proinflammatory response. During the clinical course of sepsis, both suppression and activation of immune respo
Externí odkaz:
https://doaj.org/article/cbaa26f5c3c34dd29679c95315ff49b9