Bounds for the minimum oriented diameter
classification
🧮 math.CO
keywords
diameterminimumorientedboundboundsbridgelessconnectedconsider
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.