Pages that link to "Item:Q5170276"
From MaRDI portal
The following pages link to A Practical Approach to Courcelle's Theorem (Q5170276):
Displaying 14 items.
- Courcelle's theorem for triangulations (Q346450) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Tree \(t\)-spanners in outerplanar graphs via supply demand partition (Q496441) (← links)
- Practical access to dynamic programming on tree decompositions (Q2005578) (← links)
- Structural parameterizations of Tracking Paths problem (Q2089072) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- A Note on the Minimum H-Subgraph Edge Deletion (Q2947962) (← links)
- Implementing Courcelle's Theorem in a declarative framework for dynamic programming (Q3133156) (← links)
- Practical Access to Dynamic Programming on Tree Decompositions (Q5009563) (← links)
- Default logic and bounded treewidth (Q5918613) (← links)
- Lifted inference with tree axioms (Q6088316) (← links)