Sciweavers

626 search results - page 126 / 126
» When Can Formal Methods Make a Real Difference
Sort
View
STACS
2010
Springer
14 years 23 days ago
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...