A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width (Q1933649): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejc.2012.07.024 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2138209880 / rank | |||
Normal rank | |||
Latest revision as of 23:43, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width |
scientific article |
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
