The complexity of designing a network with minimum diameter (Q3910007)

From MaRDI portal
Revision as of 12:13, 13 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 complexity of designing a network with minimum diameter
scientific article

    Statements

    title
    The complexity of designing a network with minimum diameter (English)
    0 references
    author
    Ján Plesník
    0 references
    published in
    Networks
    0 references
    publication date
    1981
    0 references
    zbMATH Keywords
    subgraph
    0 references
    NP-hardness for the design problem
    0 references

    Identifiers

    zbMATH DE Number
    3720366
    0 references
    OpenAlex ID
    W2014154116
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3910007&oldid=34651292"
    Powered by MediaWiki