Publication:5891097: Difference between revisions
Created automatically from import240129110155 |
EloiFerrer (talk | contribs) m EloiFerrer moved page Finding an induced subdivision of a digraph to Finding an induced subdivision of a digraph: Duplicate |
(No difference)
|
Latest revision as of 12:24, 29 April 2024
DOI10.1016/j.endm.2011.05.003zbMath1268.05191arXiv1309.1553OpenAlexW2884902798MaRDI QIDQ5891097
Frédéric Havet, Nicolas Trotignon, Jörgen Bang-Jensen
Publication date: 23 July 2013
Published in: Electronic Notes in Discrete Mathematics, Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.1553
Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (7)
Cites Work
- The three-in-a-tree problem
- Induced disjoint paths problem in a planar digraph
- Disjoint directed and undirected paths and cycles in digraphs
- The directed subgraph homeomorphism problem
- On the complexity of testing for odd holes and induced odd paths
- Corrigendum to: On the complexity of testing for odd holes and induced odd paths
- Graph minors. XIII: The disjoint paths problem
- Finding an induced subdivision of a digraph
- Detecting induced subgraphs
- Unnamed Item
- Unnamed Item
This page was built for publication: Finding an induced subdivision of a digraph