On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346)
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: On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width |
scientific article; zbMATH DE number 5711876
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width |
scientific article; zbMATH DE number 5711876 |
Statements
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (English)
0 references
25 May 2010
0 references
rank-width
0 references
parameterized algorithm
0 references
Myhill-Nerode theorem
0 references
graph colouring
0 references
0 references
0.83411765
0 references
0.83411765
0 references
0.83101785
0 references
0.82871497
0 references
0.82795644
0 references
0.8275196
0 references
