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

From MaRDI portal
Revision as of 09:46, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references