A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs (Q2034399)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs
scientific article

    Statements

    A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs (English)
    0 references
    0 references
    0 references
    0 references
    22 June 2021
    0 references
    bisection
    0 references
    fixed-parameter tractability
    0 references
    treewidth
    0 references

    Identifiers