Finding a subdivision of a prescribed digraph of order 4
Havet, Frédéric ; Maia, Ana Karolinna ; Mohar, Bojan, 1956-
The problem of when a given digraph contains a subdivision of a fixed digraph ▫$F$▫ is considered. J. Bang-Jensen et al. [Theor. Comput. Sci. 562, 283--303 (2015)] laid out foundations for ...approaching this problem from the algorithmic point of view. In this article, we give further support to several open conjectures and speculations about algorithmic complexity of finding ▫$F$▫-subdivisions. In particular, up to five exceptions, we completely classify for which 4-vertex digraphs ▫$F$▫, the ▫$F$▫-subdivision problem is polynomial-time solvable and for which it is NP-complete. While all NP-hardness proofs are made by reduction from some version of the 2-linkage problem in digraphs, some of the polynomial-time solvable cases involve relatively complicated algorithms.
It was not necessary to add the material to the shelf.
Bibliographic material was successfully added on shelf.
Adding bibliographical material on shelf was not successful.
Material is already on the shelf.
Permalink
URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year
Impact factor
Edition
Category
Classification
JCR
SNIP
JCR
SNIP
JCR
SNIP
JCR
SNIP
Select the library membership card:
DRS,
in which the journal is indexed
Database name
Field
Year
Links to authors' personal bibliographies
Links to information on researchers in the SICRIS system
Subject headings in COBISS General List of Subject Headings
Select pickup location
The material from the parent unit is free. If the material is delivered to the pickup location from another unit, the library may charge you for this service.
PDF
