Centroidal Localization Game

Electronic Journal Of Combinatorics

Bartłomiej Bosek¹ 

关键词: Cops and robber;    Graph searching;    Outerplanar graphs;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

One important problem in a network $G$ is to locate an (invisible) moving entity by using distance-detectors placed at strategical locations in $G$. For instance, the famous metric dimension of a graph $G$ is the minimum number $k$ of detectors placed in

【 授权许可】

Others