An approach to emulating separable graphs (Q4277376): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework for off-line permutation routing in parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal emulations by butterfly-like networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Graphs for Bounded-Degree Trees and Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Embeddings of Trees in Hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for solving VLSI graph layout problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5834367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisection of Circle Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal embeddings of butterfly-like graphs in the hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laying Out Graphs Using Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Product-shuffle networks: Toward reconciling shuffles and butterflies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Processing with the Perfect Shuffle / rank
 
Normal rank

Latest revision as of 12:52, 22 May 2024

scientific article; zbMATH DE number 495449
Language Label Description Also known as
English
An approach to emulating separable graphs
scientific article; zbMATH DE number 495449

    Statements