Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Gabriela R. Argiroffo"'
Publikováno v:
Information Processing Letters. 138:75-80
We consider two variations of graph total domination, namely, k-tuple total domination and total {k}-domination (for a fixed positive integer k). Their related decision problems are both NP-complete even for bipartite graphs. In this work, we study s
Publikováno v:
Combinatorial Optimization. ISCO 2020
Combinatorial Optimization. ISCO 2020, pp.3-14, 2020, Print 978-3-030-53261-1 / Online 978-3-030-53262-8. ⟨10.1007/978-3-030-53262-8_1⟩
Lecture Notes in Computer Science ISBN: 9783030532611
ISCO
Combinatorial Optimization. ISCO 2020, pp.3-14, 2020, Print 978-3-030-53261-1 / Online 978-3-030-53262-8. ⟨10.1007/978-3-030-53262-8_1⟩
Lecture Notes in Computer Science ISBN: 9783030532611
ISCO
International audience; The problems of determining open locating-dominating or locating total-dominating sets of minimum cardinality in a graph G are variations of the classical minimum dominating set problem in G and are all known to be hard for ge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ba0bdf53b8ab5e27ffc0eb834bb6f7c4
https://hal.uca.fr/hal-03152094
https://hal.uca.fr/hal-03152094
Publikováno v:
Discrete Applied Mathematics
Discrete Applied Mathematics, 2020, 281, pp.6-41. ⟨10.1016/j.dam.2019.08.001⟩
Discrete Applied Mathematics, Elsevier, 2020, 281, pp.6-41. ⟨10.1016/j.dam.2019.08.001⟩
Discrete Applied Mathematics, 2020, 281, pp.6-41. ⟨10.1016/j.dam.2019.08.001⟩
Discrete Applied Mathematics, Elsevier, 2020, 281, pp.6-41. ⟨10.1016/j.dam.2019.08.001⟩
International audience; The problems of determining minimum identifying, locating-dominating or open locating-dominating codes are special search problems that are challenging both from a theoretical and a computational point of view, even for severa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::830f7b7860c4dc5ae8549c5071a7ae71
https://hal.uca.fr/hal-03154751/document
https://hal.uca.fr/hal-03154751/document
Publikováno v:
Discrete Optimization
Discrete Optimization, Elsevier, 2016, 22, pp.225-240. ⟨10.1016/j.disopt.2016.06.002⟩
Discrete Optimization, 2016, 22, pp.225-240. ⟨10.1016/j.disopt.2016.06.002⟩
Discrete Optimization, Elsevier, 2016, 22, pp.225-240. ⟨10.1016/j.disopt.2016.06.002⟩
Discrete Optimization, 2016, 22, pp.225-240. ⟨10.1016/j.disopt.2016.06.002⟩
International audience; The identifying code problem is a newly emerging search problem, challenging both from a theoretical and a computational point of view, even for special graphs like bipartite graphs and split graphs. Hence, a typical line of a
Publikováno v:
LAGOS
Electronic Notes in Theoretical Computer Science
LAGOS 2019
LAGOS 2019, Jun 2019, Belo Horizonte, Brazil. pp.135-145, ⟨10.1016/j.entcs.2019.08.013⟩
Electronic Notes in Theoretical Computer Science
LAGOS 2019
LAGOS 2019, Jun 2019, Belo Horizonte, Brazil. pp.135-145, ⟨10.1016/j.entcs.2019.08.013⟩
International audience; The problems of determining minimum identifying, locating-dominating, open locating-dominating or locating total-dominating codes in a graph G are variations of the classical minimum dominating set problem in G and are all kno
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6e0dd95e273f98f3826dd5d55214441e
https://hal.uca.fr/hal-02017469/document
https://hal.uca.fr/hal-02017469/document
Publikováno v:
International Transactions in Operational Research. 24:355-367
Fil: Argiroffo, Gabriela Rut. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingenieria y Agrimensura; Argentina
Publikováno v:
Discrete Applied Mathematics
Discrete Applied Mathematics, 2018, 245, pp.16-27. ⟨10.1016/j.dam.2017.06.005⟩
Discrete Applied Mathematics, Elsevier, 2018, 245, pp.16-27
Discrete Applied Mathematics, Elsevier, 2018, 245, pp.16-27. ⟨10.1016/j.dam.2017.06.005⟩
Discrete Applied Mathematics, 2018, 245, pp.16-27
Discrete Applied Mathematics, 2018, 245, pp.16-27. ⟨10.1016/j.dam.2017.06.005⟩
Discrete Applied Mathematics, Elsevier, 2018, 245, pp.16-27
Discrete Applied Mathematics, Elsevier, 2018, 245, pp.16-27. ⟨10.1016/j.dam.2017.06.005⟩
Discrete Applied Mathematics, 2018, 245, pp.16-27
The identifying code problem is a newly emerging search problem, challenging both from a theoretical and a computational point of view, even for special graphs like bipartite graphs. Hence, a typical line of attack for this problem is to determine mi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5817012cda1913d2d4de7b6122f580ac
https://hal.science/hal-02047315/file/idcode_ablw_poly_subm.pdf
https://hal.science/hal-02047315/file/idcode_ablw_poly_subm.pdf
The identifying code problem is a special search problem, challenging both from a theoretical and from a computational point of view, even for several graphs where other usually hard problems are easy to solve, like bipartite graphs or chordal graphs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7085139eb2f1f22dcddb73d83249d7b8
https://www.sciencedirect.com/science/article/pii/S1571065317302822
https://www.sciencedirect.com/science/article/pii/S1571065317302822
Publikováno v:
Information Processing Letters. 115:556-561
We consider two types of graph domination- { k } -domination and k-tuple domination, for a fixed positive integer k-and provide new NP-complete as well as polynomial time solvable instances for their related decision problems. Regarding NP-completene
Publikováno v:
Electronic Notes in Discrete Mathematics. 44:269-274
Given a graph G and a nonnegative integer number k , a k -dominating set in G is a subset of vertices D such that every vertex in the graph is adjacent to at least k elements of D . The k -dominating set polytope is the convex hull of the incidence v