A polynomial algorithm for the min-cut linear arrangement of trees (Q3771641)

From MaRDI portal
Revision as of 21:36, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A polynomial algorithm for the min-cut linear arrangement of trees
scientific article

    Statements

    title
    A polynomial algorithm for the min-cut linear arrangement of trees (English)
    0 references
    author
    Mihalis Yannakakis
    0 references
    publication date
    1985
    0 references
    zbMATH Keywords
    cutwidth
    0 references
    min-cut linear arrangement
    0 references

    Identifiers

    DOI
    10.1145/4221.4228
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    68Q25
    0 references
    05C05
    0 references
    91A05
    0 references
    zbMATH DE Number
    4031008
    0 references
    OpenAlex ID
    W1980008391
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3771641&oldid=32004245"
    Powered by MediaWiki