Výsledky vyhledávání - "Yanina Lucarini"

Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in Graphs

Autor: Silvia M. Bianchi, Yanina Lucarini, Annegret Wagler, Gabriela R. Argiroffo

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

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

Zobrazit plný text záznamu

Linear-time algorithms for three domination-based separation problems in block graphs

Autor: Annegret Wagler, Silvia M. Bianchi, Gabriela R. Argiroffo, Yanina Lucarini

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⟩

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

Zobrazit plný text záznamu

The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations

Autor: Gabriela R. Argiroffo, Annegret Wagler, Yanina Lucarini, Silvia M. Bianchi

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⟩

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

Zobrazit plný text záznamu

Polyhedra associated with identifying codes in graphs

Autor: Annegret Wagler, Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini

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

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

Zobrazit plný text záznamu

A linear-time algorithm for the identifying code problem on block graphs

Autor: Yanina Lucarini, Annegret Wagler, Gabriela R. Argiroffo, Silvia M. Bianchi

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

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání