Subexponential-time and FPT algorithms for embedded flat clustered planarity (Q1627160): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:42, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Subexponential-time and FPT algorithms for embedded flat clustered planarity |
scientific article |
Statements
Subexponential-time and FPT algorithms for embedded flat clustered planarity (English)
0 references
22 November 2018
0 references
