Titlebook: ;

影响

https://doi.org/10.1007/978-3-322-90696-0nt to the system of 2-cuts of .. For 3-cuts and .. of a 3-edge-connected graph we follow [DKL76]. The space complexity of the description suggested is . (though the total number of 3-cuts may be a cubic function of .).

meditation

Palliation

Reservation

Embeddings in recursive combinatorial networks, isomorphic, embedded full binary trees (FBT‘s) in RCN‘s with expansion of two. A routing scheme is designed which resolves the root congestion problem in such binary trees. Finally, an .× . mesh is embedded in RCN‘s with dilation of one and expansion of 2.., where 2. < . ≤ 2. for . ≥ 2.

谈判

https://doi.org/10.1007/978-3-322-93297-6er of processors used). The results of this kind are generalized in a trade-off among time, number of processors, separator of the network and the communication complexity of the problem computed. These results are extended also for a probabilistic model of parallel networks.

rectum

CLAN

GEON

Topology of parallel networks and computational complexity (extended abstract),er of processors used). The results of this kind are generalized in a trade-off among time, number of processors, separator of the network and the communication complexity of the problem computed. These results are extended also for a probabilistic model of parallel networks.

Ccu106

向下

A new characterization of tree medians with applications to distributed algorithms,oosing a median and then routing all the information through it is the best possible strategy, in terms of worst-case number of messages sent during any execution of any distributed sorting algorithm. We also discuss the implications for networks of a general topology and for the distributed ranking problem.