Pages that link to "Item:Q473216"
From MaRDI portal
The following pages link to Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216):
Displayed 9 items.
- Computing the clique-width of cactus graphs (Q1744436) (← links)
- Fly-automata for checking \(\mathrm{MSO}_2\) graph properties (Q1752502) (← links)
- Complexity of the multilevel critical node problem (Q2121476) (← links)
- The complexity of restricted star colouring (Q2161257) (← links)
- Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value (Q2289024) (← links)
- (Q3386630) (← links)
- Transforming graph states using single-qubit operations (Q4561771) (← links)
- Computations by fly-automata beyond monadic second-order logic (Q5964015) (← links)
- The firebreak problem (Q6065343) (← links)