DynASP2.5: Dynamic Programming on Tree Decompositions in Action

DynASP2.5: Dynamic Programming on Tree Decompositions in Action

Efficient exact parameterized algorithms are an active research area. Such algorithms exhibit a broad interest in the theoretical community. In the last few years, implementations for computing various parameters (parameter detection) have been established in parameterized challenges, such as treewi...

Full description

Bibliographic Details
Main Authors: Johannes K. Fichte, Markus Hecher, Michael Morak, Stefan Woltran
Format: Article
Language:English
Published: MDPI AG 2021-03-01
Series:Algorithms
Subjects:
parameterized algorithms
fixed-parameter linear time
semi-incidence graph
tree decompositions
multi-pass dynamic programming
Online Access:https://www.mdpi.com/1999-4893/14/3/81

Internet

https://www.mdpi.com/1999-4893/14/3/81

Similar Items