1 citations · 3 across the 3 of their papers we have counts for
3 papers
math.CO2021★ 1 cited
On the computational complexity of the Steiner -eccentricity
Xingfu Li, Guihai Yu, Aleksandar Ilić +1
The Steiner -eccentricity of a vertex of a graph is the maximum Steiner distance over all -subsets of which contain . A linear time algorithm for calculati…
math.CO2020★ 1 cited
On the average Steiner 3-eccentricity of trees
Xingfu Li, Guihai Yu, Sandi Klavžar
The Steiner -eccentricity of a vertex of a graph is the maximum Steiner distance over all -subsets of which contain . In this paper Steiner -eccentricity…
cs.DS2014★ 1 cited
A 4/3-approximation algorithm for finding a spanning tree to maximize its internal vertices
Xingfu Li, Daming Zhu
This paper focuses on finding a spanning tree of a graph to maximize the number of its internal vertices. We present an approximation algorithm for this problem which can achieve a…