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

From MaRDI portal
Revision as of 14:53, 7 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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=34372854"
    Powered by MediaWiki