Facility dispersion seeks to locate the facilities as far away from each other as possible, which has attracted a multitude of research attention recently due to the pressing need on dispersing facilities in various scenarios. In this paper, as a facility dispersion problem, the geometric maximum k-star problem is considered. Given a set P of n points in the Euclidean plane, a k-star is defined...

We study here the problem of exploring a temporal graph when underlying is star. The aim exploration in star finding walk which starts and finishes at center star, visits all leaves. present systematic computational complexity this problem, depending on number k time points where each edge can be graph. distinguish between decision version StarExp(k), asking whether complete exists, maximizatio...