Pages that link to "Item:Q5111757"
From MaRDI portal
The following pages link to Positive-Instance Driven Dynamic Programming for Treewidth. (Q5111757):
Displaying 6 items.
- Solving Graph Problems via Potential Maximal Cliques (Q4629543) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- (Q5009490) (← links)
- Practical Access to Dynamic Programming on Tree Decompositions (Q5009563) (← links)
- (Q5874530) (← links)
- The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. (Q6089686) (← links)
