Memory Requirements for Table Computations in Partial k-Tree Algorithms

Bengt Aspvall, Jan Arne Telle, Andrzej Proskurowski. Memory Requirements for Table Computations in Partial k-Tree Algorithms. Algorithmica, 27(3):382-394, 2000. [doi]

@article{AspvallTP00,
  title = {Memory Requirements for Table Computations in Partial k-Tree Algorithms},
  author = {Bengt Aspvall and Jan Arne Telle and Andrzej Proskurowski},
  year = {2000},
  url = {http://link.springer.de/link/service/journals/00453/contents/00/10025/},
  researchr = {https://researchr.org/publication/AspvallTP00},
  cites = {0},
  citedby = {0},
  journal = {Algorithmica},
  volume = {27},
  number = {3},
  pages = {382-394},
}