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]

Authors

Feodor F. Dragan

This author has not been identified. Look up 'Feodor F. Dragan' in Google