Multicolor routing in the undirected hypercube (Q1971219): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3128902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5513488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668821 / 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: On Edge Coloring Bipartite Graphs / 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: Multicolor routing in the undirected hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / 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: Efficient routing in all-optical networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routings for involutions of a hypercube / rank
 
Normal rank

Latest revision as of 14:52, 29 May 2024

scientific article
Language Label Description Also known as
English
Multicolor routing in the undirected hypercube
scientific article

    Statements