Finding a subdivision of a digraph

Jørgen Bang-Jensen (1) , Frédéric Havet (2) , Ana Karolinna Maia de Oliviera (2)

1 IMADA - Department of Mathematics and Computer Science [Odense]
2 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications

We consider the following problem for oriented graphs and digraphs: Given a directed graph D, does it contain a subdivision of a prescribed digraph F? We give a number of examples of polynomial instances, several NP-completeness proofs as well as a number of conjectures and open problems.

Nous considérons le problèmes suivant: étant donné un graphe orienté D, contient-il une subdivision d'un digraphe fixé F? Nous donnons des exemples d'instances polynomiales, plusieurs preuves de NP-complétude ainsi que un certain nombre de conjectures et des problèmes ouverts.

Mots clés: NP-completeness; 2-linkage; flows; DAG and handle decompositions.; DAG and handle decompositions

Domaines: Algorithme et structure de données [cs.DS]

Jørgen Bang-Jensen, Frédéric Havet, Ana Karolinna Maia de Oliviera. Finding a subdivision of a digraph. [Research Report] RR-8024, INRIA. 2012. ⟨hal-00720500v2⟩