The Complexity of Approximating the Oriented Diameter of Chordal Graphs

Fedor V. Fomin, Martín Matamala, Ivan Rapaport. The Complexity of Approximating the Oriented Diameter of Chordal Graphs. In Ludek Kucera, editor, Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers. Volume 2573 of Lecture Notes in Computer Science, pages 211-222, Springer, 2002. [doi]

Abstract

Abstract is missing.