Pages that link to "Item:Q1764801"
From MaRDI portal
The following pages link to Tree decompositions with small cost (Q1764801):
Displaying 16 items.
- Approximately counting locally-optimal structures (Q295655) (← links)
- A faster tree-decomposition based algorithm for counting linear extensions (Q786030) (← links)
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- On tradeoffs between width- and fill-like graph parameters (Q1999998) (← links)
- A revisit of the scheme for computing treewidth and minimum fill-in (Q2441783) (← links)
- Tree decompositions of graphs: saving memory in dynamic programming (Q2465936) (← links)
- A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760) (← links)
- Approximately Counting Locally-Optimal Structures (Q3448823) (← links)
- Solving Graph Problems via Potential Maximal Cliques (Q4629543) (← links)
- (Q4944974) (← links)
- A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions (Q5009467) (← links)
- Seeing Arboretum for the (partial k-) Trees (Q5042445) (← links)
- (Q5150524) (← links)
- Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)
- Minimum size tree-decompositions (Q5890931) (← links)
- Minimum size tree-decompositions (Q5916057) (← links)