Pages that link to "Item:Q408375"

The following pages link to Courcelle's theorem -- a game-theoretic approach (Q408375):

Displaying 15 items.

• On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity (Q272014) (← links)
• Courcelle's theorem for triangulations (Q346450) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
• Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
• Fly-automata for checking \(\mathrm{MSO}_2\) graph properties (Q1752502) (← links)
• Practical access to dynamic programming on tree decompositions (Q2005578) (← links)
• Digraph width measures in parameterized algorithmics (Q2442211) (← links)
• Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
• Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
• Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory (Q3010429) (← links)
• (Q3386630) (← links)
• Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams (Q3449205) (← links)
• Practical Access to Dynamic Programming on Tree Decompositions (Q5009563) (← links)
• DynASP2.5: Dynamic Programming on Tree Decompositions in Action (Q5111876) (← links)