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
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2016

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

Abstract

An oriented graph $\overrightarrow{G}$ is said weak (resp. strong) if, for every pair $\{ u,v \}$ of vertices of $\overrightarrow{G}$, there are directed paths joining $u$ and $v$ in either direction (resp. both directions). In case, for every pair of vertices, some of these directed paths have length at most $k$, we call $\overrightarrow{G}$ $k$-weak (resp. $k$-strong). We consider several problems asking whether an undirected graph $G$ admits orientations satisfying some connectivity and distance properties. As a main result, we show that deciding whether $G$ admits a $k$-weak orientation is NP-complete for every $k \geq 2$. This notably implies the NP-completeness of several problems asking whether $G$ is an extremal graph (in terms of needed colours) for some vertex-colouring problems.
Fichier principal
Vignette du fichier
2704-9863-1-PB.pdf (269.17 Ko) Télécharger le fichier
Origin : Explicit agreement for this submission
Loading...

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

Cite

Julien Bensmail, Romaric Duvignau, Sergey Kirgizov. The complexity of deciding whether a graph admits an orientation with fixed weak diameter. Discrete Mathematics and Theoretical Computer Science, 2016, Vol. 17 no. 3 (3), pp.31-42. ⟨10.46298/dmtcs.2161⟩. ⟨hal-00824250v6⟩
734 View
1126 Download

Altmetric

Share

Gmail Facebook X LinkedIn More