An efficient clustering algorithm for pa
โ
Piyush Maheshwari; Hong Shen
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 254 KB
This paper presents a clustering algorithm that partitions node-labelled and edge-labelled ลฝ . directed acyclic precedence graphs APG into clusters such that all the clusters have balanced amount of computation load and there is only one communication path between any pair of clusters. The algorithm