On the computational complexity of the Steiner $k$-eccentricity

Xingfu Li, Guihai Yu, Aleksandar Ilić +1

The Steiner $k$-eccentricity of a vertex $v$ of a graph $G$ is the maximum Steiner distance over all $k$-subsets of $V(G)$ which contain $v$. A linear time algorithm for calculati…