The complexity of designing a network with minimum diameter (Q3910007): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank

Latest revision as of 12:13, 13 June 2024

scientific article
Language Label Description Also known as
English
The complexity of designing a network with minimum diameter
scientific article

    Statements

    The complexity of designing a network with minimum diameter (English)
    0 references
    0 references
    0 references
    1981
    0 references
    subgraph
    0 references
    NP-hardness for the design problem
    0 references

    Identifiers