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]
@inproceedings{AspvallPT98,
title = {Memory Requirements for Table Computations in Partial k-tree Algorithms},
author = {Bengt Aspvall and Andrzej Proskurowski and Jan Arne Telle},
year = {1998},
url = {http://link.springer.de/link/service/series/0558/bibs/1432/14320222.htm},
researchr = {https://researchr.org/publication/AspvallPT98},
cites = {0},
citedby = {0},
pages = {222-233},
booktitle = {Algorithm Theory - SWAT 98, 6th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
editor = {Stefan Arnborg and Lars Ivansson},
volume = {1432},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-64682-5},
}