On Bottleneck Partitioning of k-Ary n-Cubes


Graph partitioning is a topic of extensive interest, with applications to parallel processing. In this context graph nodes typically represent computation, and edges represent communication. One seeks to distribute the workload by partitioning the graph so that every processor has approximately the same workload, and the communication cost (measured as a… (More)
DOI: 10.1142/S0129626496000376


3 Figures and Tables

Cite this paper

@article{Nicol1996OnBP, title={On Bottleneck Partitioning of k-Ary n-Cubes}, author={David M. Nicol and Weizhen Mao}, journal={Parallel Processing Letters}, year={1996}, volume={6}, pages={389-399} }