A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks (Q2110363): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 23:17, 1 February 2024

scientific article
Language Label Description Also known as
English
A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks
scientific article

    Statements

    A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 December 2022
    0 references
    0 references
    conditional bijective connection networks
    0 references
    edge independent spanning trees
    0 references
    line graph
    0 references
    data center network
    0 references