Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Practical algorithms for MSO model-checking on tree-decomposable graphs |
scientific article; zbMATH DE number 6372046
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Practical algorithms for MSO model-checking on tree-decomposable graphs |
scientific article; zbMATH DE number 6372046 |
Statements
Practical algorithms for MSO model-checking on tree-decomposable graphs (English)
0 references
24 November 2014
0 references
monadic second-order logic
0 references
tree decompositions
0 references
Courcelle's theorem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8371982574462891
0 references
0.8092630505561829
0 references
0.7989266514778137
0 references
0.7978926301002502
0 references
