Pages that link to "Item:Q964001"
From MaRDI portal
The following pages link to Treewidth computations. I: Upper bounds (Q964001):
Displaying 50 items.
- Reduction rules for the maximum parsimony distance on phylogenetic trees (Q306268) (← links)
- Differential geometric treewidth estimation in adiabatic quantum computation (Q332093) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions (Q516870) (← links)
- Treewidth computations. II. Lower bounds (Q549673) (← links)
- Boolean-width of graphs (Q719257) (← links)
- Complexity of secure sets (Q722534) (← links)
- Treewidth distance on phylogenetic trees (Q1637220) (← links)
- Systematic and deterministic graph minor embedding for Cartesian products of graphs (Q1679291) (← links)
- Turbocharging treewidth heuristics (Q1725636) (← links)
- Towards fixed-parameter tractable algorithms for abstract argumentation (Q1761281) (← links)
- Exploiting sparsity in complex polynomial optimization (Q2073057) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- The tree-width of C (Q2174562) (← links)
- Exploiting sparsity for the min \(k\)-partition problem (Q2175445) (← links)
- Exploiting term sparsity in noncommutative polynomial optimization (Q2231045) (← links)
- A sequential reduction method for inference in generalized linear mixed models (Q2259531) (← links)
- Variable neighborhood search for graphical model energy minimization (Q2287189) (← links)
- Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth (Q2314068) (← links)
- Algorithms and complexity for Turaev-Viro invariants (Q2316773) (← links)
- Learning tractable Bayesian networks in the space of elimination orders (Q2321308) (← links)
- Evaluating Datalog via tree automata and cycluits (Q2322722) (← links)
- Methods for solving reasoning problems in abstract argumentation -- a survey (Q2341832) (← links)
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions (Q2343089) (← links)
- Lpopt: a rule optimization tool for answer set programming (Q2409731) (← links)
- On the vertex cover \(P_3\) problem parameterized by treewidth (Q2410093) (← links)
- From tree-decompositions to clique-width terms (Q2413974) (← links)
- Branch decomposition heuristics for linear matroids (Q2445840) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
- The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing (Q2661539) (← links)
- Finding Good Decompositions for Dynamic Programming on Dense Graphs (Q2891352) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- On the Boolean-Width of a Graph: Structure and Applications (Q3057622) (← links)
- A Local Search Algorithm for Branchwidth (Q3075536) (← links)
- A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings (Q3161084) (← links)
- Algorithms and Complexity for Turaev-Viro Invariants (Q3448792) (← links)
- Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams (Q3449205) (← links)
- Boolean-Width of Graphs (Q3656851) (← links)
- D-FLAT: Declarative problem solving using tree decompositions and answer-set programming (Q4911127) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs (Q5042451) (← links)
- An Experimental Study of the Treewidth of Real-World Graph Data (Q5091123) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness (Q5140724) (← links)
- Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited (Q5229963) (← links)
- Treewidth of display graphs: bounds, brambles and applications (Q5233142) (← links)
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
- Customizable Contraction Hierarchies (Q5266613) (← links)
- Chordal Networks of Polynomial Ideals (Q5347294) (← links)
- Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization (Q5737726) (← links)
