Treewidth: computational experiments
From MaRDI portal
Cited in
(27)- Turbocharging treewidth heuristics
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
- ProCount: weighted projected model counting with graded project-join trees
- Exploiting sparsity for the min \(k\)-partition problem
- Algorithms for propositional model counting
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- Tractable cases of the extended global cardinality constraint
- Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
- Tree decompositions of graphs: saving memory in dynamic programming
- Tree decomposition and discrete optimization problems: a survey
- Finding good tree decompositions by local search
- Differential geometric treewidth estimation in adiabatic quantum computation
- Algorithms for Propositional Model Counting
- Encoding Treewidth into SAT
- \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions
- Heuristic and metaheuristic methods for computing graph treewidth
- Tree decompositions and social graphs
- A new global algorithm for max-cut problem with chordal sparsity
- Aspmc: new frontiers of algebraic answer set counting
- On finding short reconfiguration sequences between independent sets
- On approximability of propositional model counting
- Safe separators for treewidth
- Symbolic techniques in satisfiability solving
- Treewidth lower bounds with brambles
- Treewidth computations. I: Upper bounds
- Understanding the scalability of Bayesian network inference using clique tree growth curves
- On the maximum cardinality search lower bound for treewidth
This page was built for publication: Treewidth: computational experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2816028)
