The following pages link to Treewidthlib (Q21218):
Displayed 13 items.
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Treewidth computations. II. Lower bounds (Q549673) (← links)
- Treewidth lower bounds with brambles (Q926284) (← links)
- Graph-based knowledge representation. Computational foundations of conceptual graphs (Q932109) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- A cubic kernel for feedback vertex set and loop cutset (Q968273) (← links)
- On the maximum cardinality search lower bound for treewidth (Q997060) (← links)
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions (Q2343089) (← links)
- A SAT Approach to Branchwidth (Q2818011) (← links)
- Speeding Up Dynamic Programming with Representative Sets (Q2867093) (← links)
- Finding Good Decompositions for Dynamic Programming on Dense Graphs (Q2891352) (← links)
- Encoding Treewidth into SAT (Q3637156) (← links)
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)