Path-Driven Orientation of Mixed Graphs

Abstract : We consider in this paper two graph orientation problems. The input of both problems is (i) a mixed graph G whose vertex set is V and edge set (resp. arc set) is E (resp. A) and (ii) a set P V V of source-target pairs. The first problem, called S-GO, is a decision problem introduced by Hassin and Megiddo (Linear Algebra and its Applications 114 (1989): 589-602) and defined as follows: is it possible to find an orientation of G that replaces each edge (u; v) 2 E by a single arc (either uv or vu) in such a way that, for each (s; t) 2 P, there exists a directed path from s to t ? Our second problem, called MIN-D-GO, is a minimization problem that can be seen as a variant of S-GO, in which we allow some edges (u; v) 2 E to be doubly oriented. The goal is then to find an orientation of G that replaces each edge (u; v) 2 E by uv and/or vu in such a way that (i) there exists a directed path from s to t for each (s; t) 2 P and (ii) the number of doubly oriented edges is minimized. We investigate the complexity of SGO and MIN-D-GO by considering some restrictions on the input instances (such as the maximum degree of G or the cardinality of P). We provide several polynomial time algorithms, hardness and inapproximability results that together give an extensive picture of tractable and intractable instances for both problems.
Type de document :
Article dans une revue
Discrete Applied Mathematics, Elsevier, 2015, 181, pp.98-108. 〈10.1016/j.dam.2014.10.016〉
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01044921
Contributeur : Guillaume Fertin <>
Soumis le : lundi 4 août 2014 - 16:04:27
Dernière modification le : jeudi 5 avril 2018 - 10:36:49
Document(s) archivé(s) le : mardi 11 avril 2017 - 17:53:03

Fichier

orientation.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu. Path-Driven Orientation of Mixed Graphs. Discrete Applied Mathematics, Elsevier, 2015, 181, pp.98-108. 〈10.1016/j.dam.2014.10.016〉. 〈hal-01044921〉

Partager

Métriques

Consultations de la notice

203

Téléchargements de fichiers

212