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

DOI10.4230/LIPIcs.ICALP.2017.70zbMath1441.68161OpenAlexW2922340135MaRDI QIDQ5111401

Michał Pilipczuk, Florian Barbero, Christophe Paul

Publication date: 27 May 2020

Full work available at URL: https://doi.org/10.4230/LIPIcs.ICALP.2017.70

zbMATH Keywords

tournamentcutwidthsemi-complete digraphOLA

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (3)

Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number ⋮ Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number ⋮ Tournaments and Semicomplete Digraphs

This page was built for publication: Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs