Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Lucarini, Yanina"'
We consider the following variants of the classical minimum dominating set problem in graphs: locating-dominating set, locating total-dominating set and open locating-dominating set. All these problems are known to be hard for general graphs. A typic
Externí odkaz:
http://arxiv.org/abs/2311.13979
Publikováno v:
In Discrete Applied Mathematics 15 December 2022 322:465-480
Publikováno v:
In Discrete Applied Mathematics 15 July 2020 281:6-41
Publikováno v:
In Electronic Notes in Discrete Mathematics November 2017 62:249-254
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.
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
This book constitutes the refereed proceedings of the 10th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2024, held in Bhilai, India during February 15–17, 2024. The 22 full papers included in this book were car
This book constitutes the thoroughly refereed post-conference proceedings of the 6th International Symposium on Combinatorial Optimization, ISCO 2020, which was due to be held in Montreal, Canada, in May 2020. The conference was held virtually due t