An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time

Feodor F. Dragan. An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time. Inf. Process. Lett., 154, 2020. [doi]

@article{Dragan20,
  title = {An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time},
  author = {Feodor F. Dragan},
  year = {2020},
  doi = {10.1016/j.ipl.2019.105873},
  url = {https://doi.org/10.1016/j.ipl.2019.105873},
  researchr = {https://researchr.org/publication/Dragan20},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {154},
}