Finding an induced subdivision of a digraph. - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2012

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 G 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
subdiv-revise.pdf (219.18 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00749187 , version 1 (23-10-2016)


  • HAL Id : hal-00749187 , version 1


Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon. Finding an induced subdivision of a digraph.. Theoretical Computer Science, 2012, 443, pp.10--24. ⟨hal-00749187⟩
165 View
128 Download


Gmail Facebook Twitter LinkedIn More