The complexity of deciding whether a graph admits an orientation with fixed weak diameter - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2014

The complexity of deciding whether a graph admits an orientation with fixed weak diameter

Sergey Kirgizov

Abstract

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. We show that deciding whether a graph admits an orientation with weak diameter k is NP-complete whenever k>=2.
Fichier principal
Vignette du fichier
weak-diam.pdf (301.31 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00824250 , version 1 (21-05-2013)
hal-00824250 , version 2 (22-05-2013)
hal-00824250 , version 3 (05-06-2013)
hal-00824250 , version 4 (20-11-2013)
hal-00824250 , version 5 (18-09-2014)
hal-00824250 , version 6 (16-08-2016)

Identifiers

  • HAL Id : hal-00824250 , version 5

Cite

Julien Bensmail, Romaric Duvignau, Sergey Kirgizov. The complexity of deciding whether a graph admits an orientation with fixed weak diameter. 2014. ⟨hal-00824250v5⟩

Collections

UPMC LIP6
755 View
1252 Download

Share

Gmail Facebook X LinkedIn More