Pages that link to "Item:Q408375"
From MaRDI portal
The following pages link to Courcelle's theorem -- a game-theoretic approach (Q408375):
Displayed 9 items.
- On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity (Q272014) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← 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)
- Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams (Q3449205) (← links)
- Computations by fly-automata beyond monadic second-order logic (Q5964015) (← links)