A minimum length covering subgraph of a network (Q920001)

From MaRDI portal
Revision as of 11:03, 21 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
A minimum length covering subgraph of a network
scientific article

    Statements

    title
    A minimum length covering subgraph of a network (English)
    0 references
    DOI
    10.1007/BF02097806
    0 references
    author
    Tae Ung Kim
    0 references
    Timothy J. Lowe
    0 references
    James E. Ward
    0 references
    Richard L. Francis
    0 references
    publication date
    1989
    0 references
    zbMATH DE Number
    4162646
    0 references
    zbMATH Keywords
    central facility
    0 references
    connected network
    0 references
    transport system
    0 references
    shortest path
    0 references
    NP- hard
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q920001&oldid=34831529"
    Powered by MediaWiki