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

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

Michał Pilipczuk, Fedor V. Fomin

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

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (11)

Parameterizing edge modification problems above lower bounds ⋮ Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments ⋮ Beyond bidimensionality: parameterized subexponential algorithms on directed graphs ⋮ Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number ⋮ Unnamed Item ⋮ The solution space of sorting with recurring comparison faults ⋮ The Solution Space of Sorting with Recurring Comparison Faults ⋮ Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number ⋮ On width measures and topological problems on semi-complete digraphs ⋮ Comparing linear width parameters for directed graphs ⋮ Tournaments and Semicomplete Digraphs

This page was built for publication: Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph