Publication:2957884

DOI10.4230/LIPIcs.STACS.2013.197zbMath1354.68302arXiv1210.5363MaRDI QIDQ2957884

Michał Pilipczuk

Publication date: 30 January 2017

Full work available at URL: https://arxiv.org/abs/1210.5363

zbMATH Keywords

tournament; pathwidth; cutwidth; semi-complete digraph

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms

05C20: Directed graphs (digraphs), tournaments