Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph

DOI10.1007/978-3-642-40450-4_43zbMath1395.68359arXiv1301.7314WikidataQ60488446 ScholiaQ60488446MaRDI QIDQ2849341

Fedor V. Fomin, Michał Pilipczuk

Publication date: 17 September 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W40: Analysis of algorithms

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

05C85: Graph algorithms (graph-theoretic aspects)

05C20: Directed graphs (digraphs), tournaments