Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory (Q3010429): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q340580 |
Changed an Item |
||
| Property / author | |||
| Property / author: Peter Rossmanith / rank | |||
Normal rank | |||
Revision as of 14:24, 13 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
