One-to-many node-disjoint paths of hyper-star networks (Q442216): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Sung-Won Kim / rank
Normal rank
 
Property / author
 
Property / author: Sung-Won Kim / rank
 
Normal rank
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.dam.2012.04.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2154837657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Disjoint Shortest Paths Routing on the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3428666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3429598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest fault-free paths in hypercubes with vertex faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Hall's matching theorem to optimal routing on hypercubes / 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: Optimum broadcasting and personalized communication in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding hypercubes, rings, and odd graphs into hyper-stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Rabin numbers of folded hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing vertex-disjoint paths in \((n, k)\)-star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient dispersal of information for security, load balancing, and fault tolerance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-disjoint paths in hierarchical hypercube networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:44, 5 July 2024

scientific article
Language Label Description Also known as
English
One-to-many node-disjoint paths of hyper-star networks
scientific article

    Statements

    One-to-many node-disjoint paths of hyper-star networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 August 2012
    0 references
    interconnection network
    0 references
    hyper-star
    0 references
    one-to-many node-disjoint path
    0 references
    algorithms
    0 references

    Identifiers