Finding an induced subdivision of a digraph

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.
Type de document :
Communication dans un congrès
Electronic Notes on Discrete Mathematics. VI Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2011), Apr 2011, Bariloche, Argentina. 37, pp.09--14, 2011
Liste complète des métadonnées

https://hal.inria.fr/inria-00638464
Contributeur : Frederic Havet <>
Soumis le : vendredi 4 novembre 2011 - 18:42:10
Dernière modification le : lundi 4 décembre 2017 - 15:14:09

Identifiants

  • HAL Id : inria-00638464, version 1

Collections

Citation

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

Partager

Métriques

Consultations de la notice

143