𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient algorithm for partitioning an oriented graph into bicomponents

✍ Scribed by L. Ya. Leifman


Publisher
Springer US
Year
1968
Tongue
English
Weight
359 KB
Volume
2
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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