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
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
Journal title :
Electronic Notes in Discrete Mathematics
