Memory Requirements for Table Computations in Partial k-tree Algorithms

Bengt Aspvall, Andrzej Proskurowski, Jan Arne Telle. Memory Requirements for Table Computations in Partial k-tree Algorithms. In Stefan Arnborg, Lars Ivansson, editors, Algorithm Theory - SWAT 98, 6th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings. Volume 1432 of Lecture Notes in Computer Science, pages 222-233, Springer, 1998. [doi]

Abstract

Abstract is missing.