, Volume 18, Issue 4, pp 745-756

Optimal Orientations of Graphs and Digraphs: A Survey

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


 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 .

Received: October, 2001 Final version received: September 23, 2002