On Algorithms Employing Treewidth for L-bounded Cut Problems.
Petr KolmanPublished in: J. Graph Algorithms Appl. (2018)
Keyphrases
- optimization problems
- test problems
- orders of magnitude
- benchmark problems
- related problems
- practical problems
- problems in computer vision
- computational cost
- approximate solutions
- learning algorithm
- difficult problems
- np complete
- run times
- data structure
- space complexity
- specific problems
- np hard problems
- tree decompositions
- computationally efficient
- computational complexity
- combinatorial optimization
- decision problems
- constraint satisfaction
- heuristic methods
- theoretical analysis
- data mining techniques
- upper bound
- significant improvement
- evolutionary algorithm
- reasoning problems
- bounded treewidth
- search algorithm
- data sets