A linear fixed parameter tractable algorithm for connected pathwidth.

Mamadou Moustapha Kanté Christophe Paul Dimitrios M. Thilikos

Published in: CoRR (2020)

Keyphrases

dynamic programming
learning algorithm
objective function
worst case
linear programming
computational complexity
np hard
combinatorial optimization
simulated annealing