The dynamic predicate stashing copy problem and the Steiner problem in graphs (Q1582038)

From MaRDI portal
Revision as of 16:19, 30 May 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 dynamic predicate stashing copy problem and the Steiner problem in graphs
scientific article

    Statements

    title
    The dynamic predicate stashing copy problem and the Steiner problem in graphs (English)
    0 references
    author
    S. Marsman
    0 references
    A. Volgenant
    0 references
    Cees W. Duin
    0 references
    publication date
    3 September 2001
    0 references
    Mathematics Subject Classification ID
    90B18
    0 references
    90C27
    0 references
    90C35
    0 references
    zbMATH DE Number
    1515700
    0 references
    zbMATH Keywords
    network programming
    0 references
    communication
    0 references
    Steiner problem in graphs
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1582038&oldid=34253854"
    Powered by MediaWiki