3 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.DS2020★ 1 cited
Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees
Haitao Wang, Yiming Zhao
We consider the problem of computing the diameter of a unicycle graph (i.e., a graph with a unique cycle). We present an O(n) time algorithm for the problem, where n is the number…
cs.DS2020★ 3 cited
A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space
Haitao Wang, Yiming Zhao
Let be a path graph of vertices embedded in a metric space. We consider the problem of adding a new edge to so that the radius of the resulting graph is minimized, wher…