Finding a subdivision of a digraph

Jørgen Bang-Jensen 1 Frédéric Havet 2 Ana Karolinna Maia de Oliveira 2
2 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : We consider the following problem for oriented graphs and digraphs: Given a directed graph D, does it contain a subdivision of a prescribed digraph F? We give a number of examples of polynomial instances, several NP-completeness proofs as well as a number of conjectures and open problems.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/hal-01111374
Contributor : Frederic Havet <>
Submitted on : Sunday, October 23, 2016 - 3:41:06 PM
Last modification on : Friday, April 12, 2019 - 10:18:10 AM

File

subdivision.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01111374, version 1

Collections

Citation

Jørgen Bang-Jensen, Frédéric Havet, Ana Karolinna Maia de Oliveira. Finding a subdivision of a digraph. Theoretical Computer Science, Elsevier, 2015, 562, pp.20. ⟨hal-01111374⟩

Share

Metrics

Record views

398

Files downloads

124