AbstractA ‘sandwich graph’ is obtained by connecting the corresponding vertices of two copies of a given graph. We show how a good total exchange algorithm for a sandwich graph can be obtained from a good total exchange algorithm for its components. Applying this result to the hypercube, we obtain an optimal algorithm for total exchange on the hypercube
We present an optimal embedding of a honeycomb network (honeycomb mesh and honeycomb torus) of size ...
AbstractSome generalized communication modes enabling the dissemination of information among process...
In order to increase the potential kidney transplants between patients and their incompatible donors...
A tabular method for verication of data exchange algorithms on networks which possess a certain symm...
AbstractStar graphs, as discussed in [1], are considered to be attractive alternatives for hypercube...
Centralized matching programs have been established in several countries to organize kidney exchange...
Abstract. A homogeneous set is a non-trivial, proper subset of a graph’s vertices such that all its ...
Many authors have considered the design of complete exchange algorithms for a variety of multicomput...
Complete Exchange requires each of N processors to send a unique message to each of the remaining N-...
This paper presents several parallel algorithms on unweighted graphs for hypercube computers. The al...
Abstract. We consider a problem in extremal graph theory as introduced by Erdős, Jacobson and Lehel...
AbstractWe show how to implement divide-and-conquer algorithms without undue overhead on a wide clas...
The problem of embedding a guest graph G into a host graph H arises in the process of mapping a para...
Generalized dimension exchange (GDE) has been proposed as a method of load balancing in interconnect...
The generalized dimension exchange (GDE) method is a fully distributed load balancing method that op...
We present an optimal embedding of a honeycomb network (honeycomb mesh and honeycomb torus) of size ...
AbstractSome generalized communication modes enabling the dissemination of information among process...
In order to increase the potential kidney transplants between patients and their incompatible donors...
A tabular method for verication of data exchange algorithms on networks which possess a certain symm...
AbstractStar graphs, as discussed in [1], are considered to be attractive alternatives for hypercube...
Centralized matching programs have been established in several countries to organize kidney exchange...
Abstract. A homogeneous set is a non-trivial, proper subset of a graph’s vertices such that all its ...
Many authors have considered the design of complete exchange algorithms for a variety of multicomput...
Complete Exchange requires each of N processors to send a unique message to each of the remaining N-...
This paper presents several parallel algorithms on unweighted graphs for hypercube computers. The al...
Abstract. We consider a problem in extremal graph theory as introduced by Erdős, Jacobson and Lehel...
AbstractWe show how to implement divide-and-conquer algorithms without undue overhead on a wide clas...
The problem of embedding a guest graph G into a host graph H arises in the process of mapping a para...
Generalized dimension exchange (GDE) has been proposed as a method of load balancing in interconnect...
The generalized dimension exchange (GDE) method is a fully distributed load balancing method that op...
We present an optimal embedding of a honeycomb network (honeycomb mesh and honeycomb torus) of size ...
AbstractSome generalized communication modes enabling the dissemination of information among process...
In order to increase the potential kidney transplants between patients and their incompatible donors...
DOI
Add to ORKG