Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Graciela L. Nasini"'
Publikováno v:
Discrete Applied Mathematics. 332:70-86
Publikováno v:
CONICET Digital (CONICET)
Consejo Nacional de Investigaciones Científicas y Técnicas
instacron:CONICET
Consejo Nacional de Investigaciones Científicas y Técnicas
instacron:CONICET
In this paper we study the Grundy domination number on the X-join product G↩R of a graph G and a family of graphs R={Gv:v∈V(G)}. The results led us to extend the few known families of graphs where this parameter can be efficiently computed. We pr
Publikováno v:
LAGOS
Circulant contraction minors play a key role for characterizing ideal circular matrices in terms of minimally non ideal structures. In this article we prove necessary and sufficient conditions for a circular matrix A to have circulant contraction min
Publikováno v:
LAGOS
Coloring problems in graphs have been used to model a wide range of real applications. In particular, the List Coloring Problem generalizes the well-known Graph Coloring Problem for which many exact algorithms have been developed. In this work, we pr
Publikováno v:
Electronic Notes in Discrete Mathematics
Electronic Notes in Discrete Mathematics, Elsevier, 2018, 69, pp.85-92. ⟨10.1016/j.endm.2018.07.012⟩
Electronic Notes in Discrete Mathematics, 2018, 69, pp.85-92. ⟨10.1016/j.endm.2018.07.012⟩
Electronic Notes in Discrete Mathematics, Elsevier, 2018, 69, pp.85-92. ⟨10.1016/j.endm.2018.07.012⟩
Electronic Notes in Discrete Mathematics, 2018, 69, pp.85-92. ⟨10.1016/j.endm.2018.07.012⟩
International audience; We study minor related row family inequalities for the set covering polyhedron of circular matrices. We address the issue of generating these inequalities via the Chvátal-Gomory procedure and establish a general upper bound f
Publikováno v:
International Transactions in Operational Research
International Transactions in Operational Research, 2017, 24 (1-2), pp.325-337
International Transactions in Operational Research, Wiley, 2017, 24 (1-2), pp.325-337
International Transactions in Operational Research, 2017, 24 (1-2), pp.325-337
International Transactions in Operational Research, Wiley, 2017, 24 (1-2), pp.325-337
The aim of this paper is to study the Lovász-Schrijver PSD operator N+ applied to the edge relaxation of the stable set polytope of a graph. We are particularly interested in the problem of characterizing graphs for which N+ generates the stable set
Publikováno v:
CONICET Digital (CONICET)
Consejo Nacional de Investigaciones Científicas y Técnicas
instacron:CONICET
Consejo Nacional de Investigaciones Científicas y Técnicas
instacron:CONICET
Clique-node and closed neighborhood matrices of circular interval graphs are circular matrices. The stable set polytope and the dominating set polytope on these graphs are therefore closely related to the set packing polytope and the set covering pol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5a5e585111c0eda2cdaf523b20d7e548
http://arxiv.org/abs/1712.07057
http://arxiv.org/abs/1712.07057
Publikováno v:
CONICET Digital (CONICET)
Consejo Nacional de Investigaciones Científicas y Técnicas
instacron:CONICET
Consejo Nacional de Investigaciones Científicas y Técnicas
instacron:CONICET
This paper describes a new exact algorithm for the Equitable Coloring Problem, a coloring problem where the sizes of two arbitrary color classes differ in at most one unit. Based on the well known DSatur algorithm for the classic Coloring Problem, a
Publikováno v:
CONICET Digital (CONICET)
Consejo Nacional de Investigaciones Científicas y Técnicas
instacron:CONICET
Consejo Nacional de Investigaciones Científicas y Técnicas
instacron:CONICET
We study the Lovász–Schrijver lift-and-project operator (LS +) based on the cone of symmetric, positive semidefinite matrices, applied to the fractional stable set polytope of graphs. The problem of obtaining a combinatorial characterization of gr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ec1b6fb037941dd0da43a839ed775ac1
https://link.springer.com/article/10.1007/s10107-016-1035-1
https://link.springer.com/article/10.1007/s10107-016-1035-1
Publikováno v:
Discrete Applied Mathematics. 164:547-553
The Limited Packing and Multiple Domination problems in graphs have closely-related definitions and the same computational complexity on several graph classes. In this work we present two polynomial time reductions between them. Besides, we take into