Finding an induced subdivision of a digraph - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2010

Finding an induced subdivision of a digraph


We consider the following problem for oriented graphs and digraphs: Given an oriented graph (digraph) $G$, does it contain an induced subdivision of a prescribed digraph $D$? The complexity of this problem depends on $D$ and on whether $H$ must be an oriented graph or is allowed to contain 2-cycles. We give a number of examples of polynomial instances as well as several NP-completeness proofs
Fichier principal
Vignette du fichier
RR-7430.pdf (255.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00527518 , version 1 (19-10-2010)


  • HAL Id : inria-00527518 , version 1


Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon. Finding an induced subdivision of a digraph. [Research Report] RR-7430, INRIA. 2010. ⟨inria-00527518⟩
204 View
286 Download


Gmail Facebook Twitter LinkedIn More