Beyond bidimensionality: parameterized subexponential algorithms on directed graphs

DOI10.1016/j.ic.2013.11.006zbMath1433.68290WikidataQ60488413 ScholiaQ60488413MaRDI QIDQ391650

Fedor V. Fomin, Saket Saurabh, Daniel Lokshtanov, Venkatesh Raman, Frederic Dorn

Publication date: 10 January 2014

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2013.11.006

zbMATH Keywords

directed graph; graph algorithms; parameterized algorithms; subexponential running time

Mathematics Subject Classification ID

68W40: Analysis of algorithms

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

05C85: Graph algorithms (graph-theoretic aspects)

05C20: Directed graphs (digraphs), tournaments

68Q27: Parameterized complexity, tractability and kernelization