Complexity of approximating the oriented diameter of chordal graphs.

Fedor V. Fomin Martín Matamala Ivan Rapaport

Published in: J. Graph Theory (2004)

Keyphrases

series parallel
average degree
worst case
graph matching
undirected graph
pattern recognition
lower bound
memory requirements
graph theoretic
polynomial time complexity