Parallel algorithms for routing in nonblocking networks (Q4277375): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On-Line Algorithms for Path Selection in a Nonblocking Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Rearrangeable Multistage Connecting Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On non-blocking switching networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wide-Sense Nonblocking Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm for routing in permutation networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rearrangeable Networks with Limited Depth / rank
 
Normal rank

Latest revision as of 12:52, 22 May 2024

scientific article; zbMATH DE number 495448
Language Label Description Also known as
English
Parallel algorithms for routing in nonblocking networks
scientific article; zbMATH DE number 495448

    Statements

    Parallel algorithms for routing in nonblocking networks (English)
    0 references
    0 references
    0 references
    0 references
    31 October 1994
    0 references
    0 references
    parallel algorithms
    0 references
    routing
    0 references
    nonblocking networks
    0 references