Exploring the complexity of layout parameters in tournaments and semi-complete digraphs release_7aoy6ah4znbbzc6u77xckl2hwe

by Florian Barbero, Christophe Paul, Michał Pilipczuk

Released as a article .

2017  

Abstract

A simple digraph is semi-complete if for any two of its vertices u and v, at least one of the arcs (u,v) and (v,u) is present. We study the complexity of computing two layout parameters of semi-complete digraphs: cutwidth and optimal linear arrangement (OLA). We prove that: (1) Both parameters are NP-hard to compute and the known exact and parameterized algorithms for them have essentially optimal running times, assuming the Exponential Time Hypothesis; (2) The cutwidth parameter admits a quadratic Turing kernel, whereas it does not admit any polynomial kernel unless NP⊆coNP/poly. By contrast, OLA admits a linear kernel. These results essentially complete the complexity analysis of computing cutwidth and OLA on semi-complete digraphs. Our techniques can be also used to analyze the sizes of minimal obstructions for having small cutwidth under the induced subdigraph relation.
In text/plain format

Archived Files and Locations

application/pdf  417.7 kB
file_cq6fmycpsvaq3m7bphzigbjene
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2017-06-02
Version   v1
Language   en ?
arXiv  1706.00617v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 38c20ca4-092e-4176-89a2-14b82ca9393a
API URL: JSON