HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Finding an induced subdivision of a digraph

Frédéric Havet 1 Jørgen Bang-Jensen 2 Nicolas Trotignon 3
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
2 IMADA - Department of Mathematics and Computer Science [Odense]
3 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
Abstract : We consider the following problem for oriented graphs and digraphs: Given an oriented graph (digraph) H, does it contain an induced subdivision of a prescribed digraph D? The complexity of this problem depends on D and on whether H is an oriented graph or contains 2-cycles. We announce a number of examples of polynomial instances as well as several NP-completeness results.
Keywords : digraphs NP-completeness induced paths and cycles linkings
Document type :
Conference papers
Complete list of metadata
https://hal.inria.fr/inria-00638464
Contributor : Frederic Havet Connect in order to contact the contributor
Submitted on : Friday, November 4, 2011 - 6:42:10 PM
Last modification on : Friday, February 4, 2022 - 3:19:12 AM

Identifiers

  • HAL Id : inria-00638464, version 1

Collections

CNRS | INRIA | I3S | LIAFA | UNIV-PARIS7 | TDS-MACS | UNIV-COTEDAZUR | UNIV-PARIS | ANR | INRIA2

Citation

Frédéric Havet, Jørgen Bang-Jensen, Nicolas Trotignon. Finding an induced subdivision of a digraph. VI Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2011), Apr 2011, Bariloche, Argentina. pp.09--14. ⟨inria-00638464⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

107

 

Contact                    Legal Notice                    Personal Data