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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references