A variation on the min cut linear arrangement problem (Q3785979)

From MaRDI portal
Revision as of 14:28, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A variation on the min cut linear arrangement problem
scientific article

    Statements

    A variation on the min cut linear arrangement problem (English)
    0 references
    0 references
    0 references
    1987
    0 references
    0 references
    0 references
    0 references
    0 references
    embedding outerplanar graphs into spanning tree
    0 references
    min cut linear arrangement problem
    0 references
    NP-complete
    0 references
    linear-time algorithm
    0 references
    approximation algorithm
    0 references