Bounds for the minimum oriented diameter
Combinatorics
2008-04-09 v1
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.
Keywords
Cite
@article{arxiv.0804.1294,
title = {Bounds for the minimum oriented diameter},
author = {Sascha Kurz and Martin Laetsch},
journal= {arXiv preprint arXiv:0804.1294},
year = {2008}
}
Comments
21 pages, 6 figures