𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for hierarchical reduction and decomposition of a directed graph

✍ Scribed by J. Schwarze

Publisher
Springer Vienna
Year
1980
Tongue
English
Weight
469 KB
Volume
25
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Parallel Algorithms for Hierarchical Clu
Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
✍ Elias Dahlhaus πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 306 KB

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

An algorithm for the decomposition of gr
An algorithm for the decomposition of graphs into cliques
✍ Xiang-Ying Su πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 340 KB πŸ‘ 1 views

## Abstract Chung (F. R. K. Chung, On the decomposition of graphs, __SIAM J. Algebraic Discrete Methods__ 23 (1981), 1–12.) and independently GyΓΆri and Kostochka (E. GyΓΆri and A. V. Kostochka, On a problem of G. O. H. Katona and T. TarjΓ‘n, __Acta Math. Acad. Sci. Hung.__ 34 (1979), 321–327.) proved