Node-disjoint paths in a level block of generalized hierarchical completely connected networks (Q1929239): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.09.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973018026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4435203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3544998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault tolerance properties of pyramid networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The super connectivity of exchanged hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inherently Stabilizing Algorithm for Node-To-Node Routing over All Shortest Node-Disjoint Paths in Hypercube Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-disjoint paths in hierarchical hypercube networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wide diameter and minimum length of disjoint Menger path systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node‐disjoint paths and related problems on hierarchical cubic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short containers in Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding longest fault-free paths onto star graphs with more vertex faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest fault-free paths in star graphs with vertex faults / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:21, 6 July 2024

scientific article
Language Label Description Also known as
English
Node-disjoint paths in a level block of generalized hierarchical completely connected networks
scientific article

    Statements

    Node-disjoint paths in a level block of generalized hierarchical completely connected networks (English)
    0 references
    0 references
    0 references
    7 January 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    node-disjoint paths
    0 references
    container
    0 references
    fault tolerance
    0 references
    HCC
    0 references
    interconnection networks
    0 references
    0 references