Abstract.
For a graph or digraph G, let be the family of strong orientations of G; and for any , we denote by d(D) the diameter of D. Define . In this paper, we survey the results obtained and state some problems and conjectures for the parameter .
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: October, 2001 Final version received: September 23, 2002
Rights and permissions
About this article
Cite this article
Koh, K., Tay, E. Optimal Orientations of Graphs and Digraphs: A Survey. Graphs Comb 18, 745–756 (2002). https://doi.org/10.1007/s003730200060
Issue Date:
DOI: https://doi.org/10.1007/s003730200060