The NP-completeness of the bandwidth minimization problem (Q1223124)

From MaRDI portal
Revision as of 08:33, 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
The NP-completeness of the bandwidth minimization problem
scientific article

    Statements

    title
    The NP-completeness of the bandwidth minimization problem (English)
    0 references
    published in
    Computing
    0 references
    publication date
    1976
    0 references

    Identifiers

    DOI
    10.1007/BF02280884
    0 references
    Mathematics Subject Classification ID
    65F05
    0 references
    15A15
    0 references
    05C99
    0 references
    68Q25
    0 references
    zbMATH DE Number
    3502700
    0 references
    OpenAlex ID
    W85690038
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1223124&oldid=36901552"
    Powered by MediaWiki