Pages that link to "Item:Q5393366"
From MaRDI portal
The following pages link to A combinatorial and logical approach to linear-time computability (extended abstract) (Q5393366):
Displaying 6 items.
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- The structure of the models of decidable monadic theories of graphs (Q810005) (← links)
- Grids and their minors (Q1097897) (← links)
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families (Q1186787) (← links)
- Tree-edges deletion problems with bounded diameter obstruction sets (Q2370427) (← links)
- The Space Complexity of k-Tree Isomorphism (Q5387816) (← links)