✦ LIBER ✦
Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
✍ Scribed by Elias Dahlhaus
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 306 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
✦ Synopsis
We present efficient parallel algorithms for two hierarchical clustering heuristics. We point out that these heuristics can also be applied to solving some algorithmic problems in graphs, including split decomposition. We show that efficient parallel split decomposition induces an efficient parallel parity graph recognition algorithm. This is a consequence of the result of S. Cicerone and D. Di w x Stefano 7 that parity graphs are exactly those graphs that can be split decomposed into cliques and bipartite graphs.