An Iterative Heuristic Algorithm for Tree Decomposition
From MaRDI portal
Publication:3625014
Recommendations
- A decomposition algorithm for noncrossing trees
- A heuristic approach to the treedepth decomposition problem for large graphs
- A backtracking-based algorithm for hypertree decomposition
- Computing Tree Decompositions
- Computing Optimal Hypertree Decompositions
- Exact and heuristic algorithms for dynamic tree simplification
- An improved algorithm for finding tree decompositions of small width
- scientific article; zbMATH DE number 1420905
Cited in
(9)- Positive-instance driven dynamic programming for treewidth
- Turbocharging treewidth heuristics
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Heuristic and metaheuristic methods for computing graph treewidth
- scientific article; zbMATH DE number 1982177 (Why is no real title available?)
- Exact and heuristic algorithms for dynamic tree simplification
- Positive-instance driven dynamic programming for treewidth
- Finding good tree decompositions by local search
- Turbocharging treewidth heuristics
This page was built for publication: An Iterative Heuristic Algorithm for Tree Decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3625014)