Finding a subdivision of a digraph
type: Item
instance of: scholarly article
title: Finding a subdivision of a digraph
zbMATH Open document ID: 1303.68064
author: Frédéric Havet
author: A. Karolinna Maia
author: Jørgen Bang-Jensen
published in: Theoretical Computer Science
publication date: 2014-12-02T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6375984
zbMATH Keywords: oriented graphs
zbMATH Keywords: subdivision
zbMATH Keywords: linkage problem
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.10.004
OpenAlex ID: W2085634670
cites work: Finding an induced subdivision of a digraph
cites work: Disjoint directed and undirected paths and cycles in digraphs
cites work: DAG-Width and Parity Games
cites work: Q5422499
cites work: Q5421811
cites work: The three-in-a-tree problem
cites work: Q3077955
cites work: The directed subgraph homeomorphism problem
cites work: Q5514188
cites work: Q5501241
cites work: Finding a long directed cycle
cites work: Parameterized Approximability of the Disjoint Cycle Problem
cites work: Directed tree-width
cites work: Detecting induced subgraphs
cites work: Q4273847
cites work: Packing directed circuits
cites work: Graph minors. XIII: The disjoint paths problem
cites work: Algorithms - ESA 2003
cites work: Highly connected non-2-linked digraphs
DOI: 10.1016/J.TCS.2014.10.004
description: scientific article; zbMATH DE number 6375984