Automata approach to graphs of bounded rank-width (Q3104253)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5989947
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Automata approach to graphs of bounded rank-width |
scientific article; zbMATH DE number 5989947 |
Statements
19 December 2011
0 references
parameterized algorithm
0 references
clique-width
0 references
tree automaton
0 references
MSO logic
0 references
0.8944363594055176
0 references
0.7915160655975342
0 references
0.7864313125610352
0 references
0.7805941104888916
0 references
0.7720655202865601
0 references
