Memory requirements for table computations in partial \(k\)-tree algorithms

DOI10.1007/s004530010025zbMath0959.68096OpenAlexW2919648183MaRDI QIDQ1578422

Andrzej Proskurowski, Bengt Aspvall, Jan Arne Telle

Publication date: 27 August 2000

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004530010025

zbMATH Keywords

graphs of bounded treewidth

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Related Items (11)

Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams ⋮ Algorithms for Propositional Model Counting ⋮ Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time ⋮ Tree decompositions of graphs: saving memory in dynamic programming ⋮ Tree decompositions with small cost ⋮ Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs ⋮ Algorithms for propositional model counting ⋮ Tree-decompositions of small pathwidth ⋮ Tree-decompositions of small pathwidth ⋮ Unnamed Item ⋮ Tree Decompositions of Graphs: Saving Memory in Dynamic Programming

This page was built for publication: Memory requirements for table computations in partial \(k\)-tree algorithms