Abstract.
This paper addresses memory requirement issues arising in implementations of algorithms on graphs of bounded treewidth. Such dynamic programming algorithms require a large data table for each vertex of a tree-decomposition T of the input graph. We give a linear-time algorithm that finds the traversal order of T minimizing the number of tables stored simultaneously. We show that this minimum value is lower-bounded by the pathwidth of T plus one, and upper bounded by twice the pathwidth of T plus one. We also give a linear-time algorithm finding the depth-first traversal order minimizing the sum of the sizes of tables stored simultaneously.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received February 3, 1997; revised March 31, 1998.
Rights and permissions
About this article
Cite this article
Aspvall, B., Telle, J. & Proskurowski, A. Memory Requirements for Table Computations in Partial \sl k -Tree Algorithms . Algorithmica 27, 382–394 (2000). https://doi.org/10.1007/s004530010025
Issue Date:
DOI: https://doi.org/10.1007/s004530010025