Finding an induced subdivision of a digraph - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

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.
No file

Dates and versions

inria-00638464 , version 1 (04-11-2011)

Identifiers

  • HAL Id : inria-00638464 , version 1

Cite

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⟩
110 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More