Publication:5111401

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

Christophe Paul, Michał Pilipczuk, Florian Barbero

Publication date: 27 May 2020

zbMATH Keywords

tournament; cutwidth; semi-complete digraph; OLA

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C20: Directed graphs (digraphs), tournaments

68Q27: Parameterized complexity, tractability and kernelization