Optimal Orientations of Graphs and Digraphs: A Survey
- 115 Downloads
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 \(\).
Unable to display preview. Download preview PDF.