The complexity of deciding whether a graph admits an orientation with fixed weak diameter
Résumé
An orientation of an undirected graph G has weak diameter k if, for every pair {u,v} of vertices of G, there is a directed path with length at most k joining u and v in either direction. In this work, we show that deciding whether a graph admits an orientation with weak diameter k is NP-complete whenever k>=2.
Domaines
Mathématique discrète [cs.DM]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|