Pages that link to "Item:Q415286"
From MaRDI portal
The following pages link to On the model-checking of monadic second-order formulas with edge set quantifications (Q415286):
Displaying 15 items.
- Fly-automata for checking monadic second-order properties of graphs of bounded tree-width (Q324700) (← links)
- Characterizing width two for variants of treewidth (Q344827) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Fly-automata for checking \(\mathrm{MSO}_2\) graph properties (Q1752502) (← links)
- Automata for the verification of monadic second-order graph properties (Q1948277) (← links)
- Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- The rank-width of edge-coloured graphs (Q2392245) (← links)
- Tractability, hardness, and kernelization lower bound for and/or graph solution (Q2410230) (← links)
- From tree-decompositions to clique-width terms (Q2413974) (← links)
- $\mathbb F$ -Rank-Width of (Edge-Colored) Graphs (Q3014938) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- Computations by fly-automata beyond monadic second-order logic (Q5964015) (← links)
- Improved (In-)Approximability Bounds for d-Scattered Set (Q6107026) (← links)
