Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem (Q3219762)

From MaRDI portal
Revision as of 09:01, 2 September 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
scientific article

    Statements

    title
    Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem (English)
    0 references
    author
    Eitan M. Gurari
    0 references
    Ivan Hal Sudborough
    0 references
    publication date
    1984
    0 references

    Identifiers

    zbMATH DE Number
    3887070
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3219762&oldid=3547780"
      Powered by MediaWiki