The following pages link to (Q2816028):
Displaying 27 items.
- Differential geometric treewidth estimation in adiabatic quantum computation (Q332093) (← links)
- \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions (Q516870) (← links)
- Safe separators for treewidth (Q819825) (← links)
- Symbolic techniques in satisfiability solving (Q862403) (← links)
- Treewidth lower bounds with brambles (Q926284) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- Understanding the scalability of Bayesian network inference using clique tree growth curves (Q991030) (← links)
- On the maximum cardinality search lower bound for treewidth (Q997060) (← links)
- Turbocharging treewidth heuristics (Q1725636) (← links)
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
- ProCount: weighted projected model counting with graded project-join trees (Q2118296) (← links)
- Exploiting sparsity for the min \(k\)-partition problem (Q2175445) (← links)
- Algorithms for propositional model counting (Q2266937) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- Tractable cases of the extended global cardinality constraint (Q2430356) (← links)
- Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering (Q2457595) (← links)
- Tree decompositions of graphs: saving memory in dynamic programming (Q2465936) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- Finding good tree decompositions by local search (Q2839209) (← links)
- A SAT Approach to Clique-Width (Q2946763) (← links)
- Algorithms for Propositional Model Counting (Q3498488) (← links)
- Encoding Treewidth into SAT (Q3637156) (← links)
- Heuristic and metaheuristic methods for computing graph treewidth (Q5479837) (← links)
- Tree decompositions and social graphs (Q5856440) (← links)
- A new global algorithm for max-cut problem with chordal sparsity (Q6103705) (← links)
- Aspmc: new frontiers of algebraic answer set counting (Q6566624) (← links)
- On finding short reconfiguration sequences between independent sets (Q6627042) (← links)
