Routing permutations and 2-1 routing requests in the hypercube (Q5948960): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4944978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rearrangeable circuit-switched hypercube architectures for routing permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing a permutation in the hypercube by two sets of edge disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexample to a conjecture of Szymanski on hypercube routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routings for involutions of a hypercube / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(00)00386-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2026291005 / rank
 
Normal rank

Latest revision as of 12:01, 30 July 2024

scientific article; zbMATH DE number 1672485
Language Label Description Also known as
English
Routing permutations and 2-1 routing requests in the hypercube
scientific article; zbMATH DE number 1672485

    Statements

    Routing permutations and 2-1 routing requests in the hypercube (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2002
    0 references
    0 references
    directed symmetric \(n\)-dimensional hypercube
    0 references
    Szymanski's conjecture
    0 references
    0 references