A New Cluster Algorithm for Graphs (1998)
by
Stijn Van Dongen
| Venue: | National Research Institute for Mathematics and Computer Science in the |
| Citations: | 31 - 2 self |
BibTeX
@TECHREPORT{Dongen98anew,
author = {Stijn Van Dongen},
title = {A New Cluster Algorithm for Graphs},
institution = {National Research Institute for Mathematics and Computer Science in the},
year = {1998}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A new cluster algorithm for graphs called the Markov Cluster algorithm (MCL algorithm) is introduced.
Citations
| 3200 | Topics in Matrix Analysis - Horn, Johnson - 1994 |
| 222 | Non-Negative Matrices and Markov Chains - Seneta - 1981 |
| 105 | Mathematical classification and clustering - Mirkin - 1996 |
| 22 | Nonnegative matrices - Berman, Plemmons - 1994 |
| 18 | Inequalities: Theory of Majorization and Its Applications, volume 143 - Marshall, Olkin - 1979 |
| 6 | Tree--tree matrices and other combinatorial problems from taxonomy - Hazewinkel - 1995 |
| 4 | Classification in mathematics, discrete metric spaces, and approximation by trees, Nieuw Archief voor Wiskunde - Hazewinkel - 1995 |
| 4 | Monotonicity of ratios of means and other applications of majorization - Marshall, Olkin, et al. - 1967 |
| 4 | Nonnegative Matrices. Wiley Interscience Series - Minc - 1988 |
| 3 | Graph clustering and information structure - Dongen - 1997 |
