Space saving by dynamic algebraization based on tree-depth
From MaRDI portal
Publication:2411033
Recommendations
- Space saving by dynamic algebraization
- Saving space by algebraization
- scientific article; zbMATH DE number 3876615
- scientific article; zbMATH DE number 3907783
- Minimizing space usage in evaluation of expression trees
- Tree Decompositions of Graphs: Saving Memory in Dynamic Programming
- Tree decompositions of graphs: saving memory in dynamic programming
- Size-Depth Tradeoffs for Algebraic Formulas
- scientific article; zbMATH DE number 1798166
- scientific article; zbMATH DE number 2149351
Cites work
- A bound on the pathwidth of sparse graphs with applications to exact algorithms
- A linear time algorithm for finding tree-decompositions of small treewidth
- Approximating the number of monomer-dimer coverings of a lattice.
- Approximation algorithms for treewidth
- Counting perfect matchings as fast as Ryser
- Dimer problem in statistical mechanics-an exact result
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Exact algorithms for exact satisfiability and number of perfect matchings
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
- Faster Algebraic Algorithms for Path and Packing Problems
- Faster integer multiplication
- Fourier meets M\"{o}bius: fast subset convolution
- scientific article; zbMATH DE number 4060712 (Why is no real title available?)
- scientific article; zbMATH DE number 219228 (Why is no real title available?)
- scientific article; zbMATH DE number 1834638 (Why is no real title available?)
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Inclusion/Exclusion Meets Measure and Conquer
- Limits and Applications of Group Algebras for Parameterized Problems
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- On treewidth approximations.
- On two techniques of combining branching and treewidth
- Parameterized and Exact Computation
- Planar k-path in subexponential time and polynomial space
- Saving space by algebraization
- Separators for sphere-packings and nearest neighbor graphs
- SOFSEM 2005: Theory and Practice of Computer Science
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Tree-depth, subgraph coloring and homomorphism bounds
- Treewidth. Computations and approximations
Cited in
(17)- Width, depth, and space: tradeoffs between branching and dynamic programming
- Tree decompositions of graphs: saving memory in dynamic programming
- Time-space tradeoffs for dynamic programming algorithms in trees and bounded treewidth graphs
- Tree Decompositions of Graphs: Saving Memory in Dynamic Programming
- Efficient problem solving on tree decompositions using binary decision diagrams
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- scientific article; zbMATH DE number 3907783 (Why is no real title available?)
- On space efficiency of algorithms working on structural decompositions of graphs
- scientific article; zbMATH DE number 2149351 (Why is no real title available?)
- On space efficiency of algorithms working on structural decompositions of graphs
- Space saving by dynamic algebraization
- Algebras for tree decomposable graphs
- Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space
- Efficient diagonalization of symmetric matrices associated with graphs of small treewidth
- Space-efficient parameterized algorithms on graphs of low shrubdepth
- A parameterized complexity analysis of bounded height depth-first search trees
- Treedepth inapproximability and exponential eth lower bound
This page was built for publication: Space saving by dynamic algebraization based on tree-depth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2411033)
