Solving Cut-Problems in Quadratic Time for Graphs with Bounded Treewidth.

Hauke Brinkop Klaus Jansen

Published in: SOFSEM (2023)

Keyphrases

bounded treewidth
np complete
highly parallelizable
decision problems
tractable cases
databases
computational complexity
objective function
pairwise
prior knowledge
semi supervised
graph theoretic