The Complexity of Approximating the Oriented Diameter of Chordal Graphs.

Fedor V. Fomin Martín Matamala Ivan Rapaport

Published in: WG (2002)

Keyphrases

computational complexity
undirected graph
graph theoretic
data sets
directed graph
graph model
average degree
special case
worst case
graph matching