## Steiner Distance in Graphs--A Survey

*Mao, Yaping*;

- Subject: Mathematics - Combinatoricsacm: TheoryofComputation_GENERAL | Hardware_INTEGRATEDCIRCUITS | MathematicsofComputing_DISCRETEMATHEMATICS | TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYarxiv: Mathematics::Metric Geometry | Computer Science::Computational Geometry | Computer Science::Data Structures and Algorithms

For a connected graph $G$ of order at least $2$ and $S\subseteq V(G)$, the \emph{Steiner distance} $d_G(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. In this paper, we summarize the known results on the St... View more

Share - Bookmark

- Download from