Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal.

Daniel Lokshtanov Dániel Marx Saket Saurabh

Published in: ACM Trans. Algorithms (2018)

Keyphrases

graph theory
bounded treewidth
highly parallelizable
computational complexity
np complete
lower bound
special case
information extraction
global constraints