Three algorithmic approaches to the general position problem

Zahra Hamed-Labbafian, Narjes Sabeghi, Mostafa Tavakoli +1

If $G$ is a graph, then $X\subseteq V(G)$ is a general position set if for every two vertices $v,u\in X$ and every shortest $(u,v)$-path $P$, it holds that no inner vertex of $P$ l…