Memory requirements for table computations in partial k-tree algorithms

DOI10.1007/BFB0054370MaRDI QIDQ5054858zbMATH OpenOpenAlexFDO

Authors Bengt Aspvall, Andrzej Proskurowski, Jan Arne Telle

Publication date 9 December 2022

Published in Algorithm Theory — SWAT'98 (Search for Journal in Brave)

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

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

Cites work

• A linear time algorithm for finding tree-decompositions of small treewidth
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Graph minors. I. Excluding a forest
• scientific article; zbMATH DE number 4173000 (Why is no real title available?)
• scientific article; zbMATH DE number 4147519 (Why is no real title available?)
• scientific article; zbMATH DE number 3767061 (Why is no real title available?)
• scientific article; zbMATH DE number 1303600 (Why is no real title available?)
• scientific article; zbMATH DE number 566078 (Why is no real title available?)
• scientific article; zbMATH DE number 1107741 (Why is no real title available?)
• scientific article; zbMATH DE number 910869 (Why is no real title available?)
• Memory requirements for table computations in partial k-tree algorithms
• Searching and pebbling
• The vertex separation and search number of a graph
• Triangulating multitolerance graphs

Cited in

(3)

• Maintaining range trees is secondary memory. Part II: Lower bounds
• Memory requirements for table computations in partial k-tree algorithms
• Memory requirements for table computations in partial k-tree algorithms

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 Q5054858)