An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs (Q3092224): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q539451 |
Changed an Item |
||
| Property / author | |||
| Property / author: Peter Widmayer / rank | |||
Normal rank | |||
Revision as of 17:44, 15 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs |
scientific article |
Statements
An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs (English)
0 references
16 September 2011
0 references
