Linear-time algorithms for graphs of bounded rankwidth: a fresh look using game theory (extended abstract) (Q3010429)
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: Linear-time algorithms for graphs of bounded rankwidth: a fresh look using game theory (extended abstract) |
scientific article; zbMATH DE number 5916989
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear-time algorithms for graphs of bounded rankwidth: a fresh look using game theory (extended abstract) |
scientific article; zbMATH DE number 5916989 |
Statements
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory (English)
0 references
1 July 2011
0 references
0 references
0.8094322085380554
0 references
0.8003425598144531
0 references
0.7915160655975342
0 references
0.7809873819351196
0 references
0.7764463424682617
0 references
