Bounds for the minimum oriented diameter
| dc.creator | Kurz, Sascha | |
| dc.creator | Laetsch, Martin | |
| dc.date | 2008-04-08 | |
| dc.date.accessioned | 2026-07-07T09:31:04Z | |
| dc.date.available | 2026-07-07T09:31:04Z | |
| dc.description | 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. | |
| dc.description | 21 pages, 6 figures | |
| dc.identifier | https://arxiv.org/abs/0804.1294 | |
| dc.identifier | http://arxiv.org/abs/0804.1294 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/158333 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C12 (Primary);05C20,05C69 (Secondary) | |
| dc.title | Bounds for the minimum oriented diameter | |
| dc.type | text |