An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs (Q293380)

From MaRDI portal
Revision as of 21:18, 27 June 2023 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs
scientific article

    Statements

    An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs (English)
    0 references
    0 references
    0 references
    9 June 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    disjoint paths
    0 references
    interconnection networks
    0 references
    off-line routing algorithm
    0 references