Optimum broadcasting and personalized communication in hypercubes

Cited In (55)

Data transmission in processor networks
Directed hamiltonian packing in d-dimensional meshes and its application
Parameterized Complexity of Broadcasting in Graphs
Concurrent flows and packet routing in Cayley graphs (Preliminary version)
Some aspects of parallel and distributed iterative algorithms - a survey
Optimal communication algorithms for Manhattan Street networks
An efficient algorithm for multiple simultaneous broadcasts in the hypercube
One-to-one communication in twisted cubes under restricted connectivity
Optimal gray-code labeling and recognition algorithms for hypercubes
Modelling and analysis of communication overhead for parallel matrix algorithms
Independent spanning trees on twisted cubes
Application of the special Latin square to a parallel routing algorithm on a recursive circulant network.
Constructing edge-disjoint Steiner paths in lexicographic product networks
Optimal broadcasting in injured hypercubes using directed safety levels.
Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
Broadcasting in DMA-bound bounded degree graphs
Constructing edge-disjoint spanning trees in twisted cubes
Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks
Constructing edge-disjoint spanning trees in locally twisted cubes
Mapping pipeline skeletons onto heterogeneous platforms
Optimal broadcast for fully connected processor-node networks
Techniques for pipelined broadcast on Ethernet switched clusters
On character-based index schemes for complex wildcard search in peer-to-peer networks
Mutually independent Hamiltonian cycles of binary wrapped butterfly graphs
Minimizing broadcast costs under edge reductions in tree networks
A fault-tolerant broadcasting algorithm for hypercubes
All-to-all personalized communication on multistage interconnection networks
Independent spanning trees on folded hyper-stars
On optimal broadcasting in faulty hypercubes
A parallel routing algorithm on recursive cube of rings networks employing Hamiltonian circuit Latin square
Bandwidth efficient all-to-all broadcast on switched clusters
A bandwidth latency tradeoff for broadcast and reduction
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
Routings for involutions of a hypercube
Methods and problems of communication in usual networks
Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks
A broadcasting algorithm on the arrangement graph
One-to-many node-disjoint paths of hyper-star networks
Spanning subgraphs with applications to communication of a subclass of the Cayley-graph-based networks
Monochromatic connectivity and graph products
The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-independence number of graph products
On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube
Optimal broadcasting for locally twisted cubes
An efficient parallel construction of optimal independent spanning trees on hypercubes
Edge intersection on the hypercube computer
Optimal total exchange for a 3-D torus of processors
Communication efficient multi-processor FFT
Two-dimensional, viscous, incompressible flow in complex geometries on a massively parallel processor
A parallel routing algorithm on circulant networks employing the Hamiltonian circuit Latin square
An algorithm for routing messages between processing elements in a multiprocessor system which tolerates a maximal number of faulty links
On constructing multiple spanning trees in a hypercube
Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks
Transmitting in the \(n\)-dimensional cube
An algorithm to construct independent spanning trees on parity cubes
Proper connection number of graph products

This page was built for publication: Optimum broadcasting and personalized communication in hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375486)