Blar i Department of Informatics på emneord "subexponential-time algorithms"
Viser treff 1-1 av 1
-
Subexponential-time parameterized algorithm for Steiner tree on planar graphs
(Peer reviewed; Journal article, 2013)The well-known bidimensionality theory provides a method for designing fast, subexponential-time parameterized algorithms for a vast number of NP-hard problems on sparse graph classes such as planar graphs, bounded genus ...