An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs (Q2258080)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs |
scientific article |
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
