The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete (Q1885051)

From MaRDI portal
Revision as of 13:06, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete
scientific article

    Statements

    title
    The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete (English)
    0 references
    author
    David Muradian
    0 references
    publication date
    27 October 2004
    0 references
    zbMATH DE Number
    2111120
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1885051&oldid=14286917"
    Powered by MediaWiki