A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width (Q1933649)
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: A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width |
scientific article; zbMATH DE number 6128666
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width |
scientific article; zbMATH DE number 6128666 |
Statements
A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width (English)
0 references
24 January 2013
0 references
XP algorithms
0 references
MSOL-partitioning problems
0 references
0.8638008236885071
0 references
0.7726444005966187
0 references
0.7544160485267639
0 references
0.7543920278549194
0 references
0.7530511021614075
0 references
