Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Uda, Saeki"'
A dominating set $S$ of graph $G$ is called an $r$-grouped dominating set if $S$ can be partitioned into $S_1,S_2,\ldots,S_k$ such that the size of each unit $S_i$ is $r$ and the subgraph of $G$ induced by $S_i$ is connected. The concept of $r$-group
Externí odkaz:
http://arxiv.org/abs/2302.06983
Publikováno v:
In Theoretical Computer Science 21 May 2024 996
Autor:
Marios Mavronicolas
This book constitutes the refereed proceedings of the 13th International Conference on Algorithms and Complexity, CIAC 2023, which took place in Larnaca, Cyprus, during June 13–16, 2023. The 25 full papers included in this book were carefully rev