On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 20:34, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width |
scientific article |
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