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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.