The Complexity of Knapsack in Graph Groups.

Markus Lohrey Georg Zetzsche

Published in: STACS (2017)

Keyphrases

random walk
dynamic programming
optimal solution
worst case
directed graph
causal graph
connected components
graph matching
computational complexity
graph structure
graph based algorithm