Pages that link to "Item:Q2891352"
From MaRDI portal
The following pages link to Finding Good Decompositions for Dynamic Programming on Dense Graphs (Q2891352):
Displaying 4 items.
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems (Q392025) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Boolean-width of graphs (Q719257) (← links)
- A SAT Approach to Clique-Width (Q2946763) (← links)
