Bounds for the minimum oriented diameter
Sascha Kurz, Martin Laetsch
TL;DR
This paper improves the upper bound on the minimum oriented diameter of connected bridgeless graphs by exploring the relationship with minimal dominating sets.
Contribution
It provides a tighter upper bound on the minimum oriented diameter, advancing understanding of graph orientations and their diameters.
Findings
Improved the upper bound for minimum oriented diameter.
Established a stronger relation between oriented diameter and minimal dominating sets.
Enhanced theoretical understanding of graph orientation properties.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Computational Geometry and Mesh Generation · Complexity and Algorithms in Graphs