Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2017

Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs

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: -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. - The cutwidth parameter admits a quadratic Turing kernel, whereas it does not admit any polynomial kernel unless coNP/poly contains NP. 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.
Fichier principal
Vignette du fichier
LIPIcs-ICALP-2017-70.pdf (538.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-02021567 , version 1 (30-06-2021)

Licence

Attribution

Identifiers

Cite

Florian Barbero, Christophe Paul, Michał Pilipczuk. Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs. 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Jul 2017, Warsaw, Poland. pp.70:1--70:13, ⟨10.4230/LIPIcs.ICALP.2017.70⟩. ⟨lirmm-02021567⟩
163 View
34 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More