Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory (Q3010429): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:34, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory |
scientific article |
Statements
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory (English)
0 references
1 July 2011
0 references
