Pages that link to "Item:Q870458"
From MaRDI portal
The following pages link to Safe reduction rules for weighted treewidth (Q870458):
Displayed 13 items.
- On the maximum cardinality search lower bound for treewidth (Q997060) (← links)
- Towards fixed-parameter tractable algorithms for abstract argumentation (Q1761281) (← links)
- The tree-width of C (Q2174562) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- On sparsification for computing treewidth (Q2343087) (← links)
- An extended depth-first search algorithm for optimal triangulation of Bayesian networks (Q2374531) (← links)
- Updating credal networks is approximable in polynomial time (Q2375322) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization (Q3012824) (← links)
- A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760) (← links)
- Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs (Q5042449) (← links)
- Weighted Treewidth Algorithmic Techniques and Results (Q5387824) (← links)
- Tractable answer-set programming with weight constraints: bounded treewidth is not enough (Q5410728) (← links)