Optimal Orientations of Graphs and Digraphs: A Survey
- Cite this article as:
- Koh, K. & Tay, E. Graphs Comb (2002) 18: 745. doi:10.1007/s003730200060
- 105 Views
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 \(\).