Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Csilia Bujtás"'
Autor:
Leandro Montero, Zsolt Tuza, Csilia Bujtás, Hakim El Maftouhi, Laurent Rosaz, N. Narayanan, Johan Thapper, Marek Karpinski, Yannis Manoussakis, Jean Alexandre Anglés D’Auriac
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783319301389
WALCOM
WALCOM
Given a vertex-coloured graph, a dominating set is said to be tropical if every colour of the graph appears at least once in the set. Here, we study minimum tropical dominating sets from structural and algorithmic points of view. First, we prove that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::635d51f5a2c1410a50d34412c72295ce
https://doi.org/10.1007/978-3-319-30139-6_2
https://doi.org/10.1007/978-3-319-30139-6_2
Autor:
Zsolt Tuza, Jean Alexandre Anglés D’Auriac, Laurent Rosaz, Csilia Bujtás, N. Narayanan, Marek Karpinski, Yannis Manoussakis, Johan Thapper, Hakim El Maftouhi, Leandro Montero
Publikováno v:
Journal of Discrete Algorithms
Journal of Discrete Algorithms, Elsevier, 2018
Journal of Discrete Algorithms, Elsevier, 2018
Given a vertex-coloured graph, a dominating set is said to be tropical if every colour of the graph appears at least once in the set. Here, we study minimum tropical dominating sets from structural and algorithmic points of view. First, we prove that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fac14a678ae106dbd198fa4911adb687
http://arxiv.org/abs/1503.01008
http://arxiv.org/abs/1503.01008