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

Feodor F. Dragan

Published in: Inf. Process. Lett. (2020)

Keyphrases

spanning tree
undirected graph
minimum spanning tree
edge disjoint
minimum cost
minimum weight
edge weights
minimum spanning trees
weighted graph
root node
minimum total cost
depth first search
directed graph
approximation algorithms
random walk
np hard
special case
decision trees