An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs (Q2258080)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6410226
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs |
scientific article; zbMATH DE number 6410226 |
Statements
An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs (English)
0 references
2 March 2015
0 references
bisection
0 references
solid grid graphs
0 references
planar graphs
0 references
0 references
0.9983278
0 references
0 references
0.8706372
0 references
0.8705566
0 references
0.8699124
0 references
0.8652387
0 references
0.8547759
0 references
