Bounds for the minimum oriented diameter
arXiv:0804.1294
Abstract
We consider the problem of finding an orientation with minimum diameter of a connected bridgeless graph. Fomin et. al. discovered a relation between the minimum oriented diameter an the size of a minimal dominating set. We improve their upper bound.
21 pages, 6 figures