Memory requirements for table computations in partial k-tree algorithms

DOI10.1007/S004530010025MaRDI QIDQ1578422zbMATH OpenOpenAlexFDO

Authors Bengt Aspvall, Andrzej Proskurowski, 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

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

Recommendations

• Memory requirements for table computations in partial k-tree algorithms
• Tree decompositions of graphs: saving memory in dynamic programming
• scientific article; zbMATH DE number 7310159
• Tree Decompositions of Graphs: Saving Memory in Dynamic Programming
• On Exact Algorithms for Treewidth

Cited in

(13)

• Maintaining range trees is secondary memory. Part II: Lower bounds
• Tree decompositions with small cost
• Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
• Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time
• Algorithms for propositional model counting
• Tree decompositions of graphs: saving memory in dynamic programming
• Tree Decompositions of Graphs: Saving Memory in Dynamic Programming
• Efficient problem solving on tree decompositions using binary decision diagrams
• Algorithms for Propositional Model Counting
• Memory requirements for table computations in partial k-tree algorithms
• scientific article; zbMATH DE number 7310159 (Why is no real title available?)
• Tree-decompositions of small pathwidth
• Tree-decompositions of small pathwidth

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1578422)