Algorithmica

, Volume 27, Issue 3–4, pp 382–394 | Cite as

Memory Requirements for Table Computations in Partial \sl k -Tree Algorithms

  • B. Aspvall
  • J. A. Telle
  • A. Proskurowski

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.

Key words. Treewidth, Pathwidth, Tree traversal, Dynamic programming, External memory. 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© 2000 Springer-Verlag New York Inc.

Authors and Affiliations

  • B. Aspvall
    • 1
  • J. A. Telle
    • 1
  • A. Proskurowski
    • 2
  1. 1.Institutt for Informatikk, University of Bergen, 5020 Bergen, Norway. Bengt.Aspvall@ii.uib.no, Jan.Arne.Telle@ii.uib.no.NO
  2. 2.Department of Computer and Information Science, University of Oregon, Eugene, OR 97403, USA. andrzej@uoregon.edu.US

Personalised recommendations