Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs☆
Under an Elsevier user license
open archive
Keywords
Parameterized algorithms
Subexponential running time
Directed graph
Graph algorithms
Cited by (0)
- ☆
A preliminary version of this paper appeared in the proceedings of STACS 2010.
Copyright © 2013 Elsevier Inc. All rights reserved.