Skip to Main content Skip to Navigation
New interface
Journal articles

Finding an induced subdivision of a digraph.

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
Contributor : Frederic Havet Connect in order to contact the contributor
Submitted on : Sunday, October 23, 2016 - 3:57:33 PM
Last modification on : Thursday, August 4, 2022 - 4:52:44 PM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads