Title of article
Tree Decompositions of Graphs: Saving Memory in Dynamic Programming
Author/Authors
Betzler، نويسنده , , Nadja and Niedermeier، نويسنده , , Rolf and Uhlmann، نويسنده , , Johannes، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
6
From page
57
To page
62
Abstract
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced “anchor technique” is closely related to a tree-like set covering problem.
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2004
Journal title
Electronic Notes in Discrete Mathematics
Record number
1453669
Link To Document