Constructing edge-disjoint Steiner paths in lexicographic product networks (Q1738072)

From MaRDI portal
Revision as of 00:48, 19 July 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
Constructing edge-disjoint Steiner paths in lexicographic product networks
scientific article

    Statements

    title
    Constructing edge-disjoint Steiner paths in lexicographic product networks (English)
    0 references
    author
    Yaping Mao
    0 references
    publication date
    29 March 2019
    0 references
    Mathematics Subject Classification ID
    05C40
    0 references
    05C05
    0 references
    05C70
    0 references
    05C76
    0 references
    90B10
    0 references
    zbMATH DE Number
    7045327
    0 references
    zbMATH Keywords
    edge-connectivity
    0 references
    Steiner tree
    0 references
    edge-disjoint Steiner paths
    0 references
    packing
    0 references
    path edge-connectivity
    0 references
    lexicographic product
    0 references
    OpenAlex ID
    W2599340893
    0 references
    cites work
    Q2911581
    0 references
    Q5422499
    0 references
    Q3987052
    0 references
    Q3898529
    0 references
    Q3953800
    0 references
    Q3005852
    0 references
    Q4471308
    0 references
    Q4848216
    0 references
    Q4393242
    0 references
    Q3803148
    0 references
    Q3012590
    0 references
    Q4257150
    0 references
    Q2931463
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1738072&oldid=36486155"
    Powered by MediaWiki