3 citations · 3 across the 1 of their papers we have counts for
3 papers
math.CO2025
On the characterization of graphs with tree 3-spanners
Lan Lin, Yixun Lin
The tree spanner problem for a graph is as follows: For a given integer , is there a spanning tree of (called a tree -spanner) such that the distance in betwe…
math.CO2018
Minimum tree-stretch of Hamming graphs and higher-dimensional grids
Lan Lin, Yixun Lin
The minimum stretch spaning tree problem for a grah G is to find a spaning tree T of G such as that the maximum distance in T between two adjacent vertices is minimized. The minimu…
math.CO2017★ 3 cited
The minimum stretch spanning tree problem for typical graphs
Lan Lin, Yixun Lin
With applications in distribution systems and communication networks, the minimum stretch spanning tree problem is to find a spanning tree T of a graph G such that the maximum dist…