S. van Dongen  Home/Search
Context
Related
| cwi.nl/ftp/CWIreports/...INSR0010.ps.Z Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: cwi.nl/cwi/publicatio...INSR0010 (more) Homepages: S.van Dongen |
Rate this article:      (best)Comment on this article |
Abstract: A cluster algorithm for graphs called the Markov Cluster algorithm (MCL algorithm) is introduced. The algorithm provides basically an interface to an algebraic process defined on stochastic matrices, called the MCL process. The graphs may be both weighted (with nonnegative weight) and directed. Let G be such a graph. The MCL algorithm simulates flow in G by first identifying G in a canonical way with a Markov graph G1 . Flow is then alternatingly expanded and contracted, leading to a row of... (Update)
Similar documents based on text: More All
1.8: A New Cluster Algorithm for Graphs - van Dongen (1998) (Correct)
0.7: The MCL Multicast Library: Concepts, Architecture and Use - Roca (Correct)
0.3: Performance Criteria for Graph Clustering and Markov Cluster.. - van Dongen (2000) (Correct)
BibTeX entry: (Update)
@misc{ dongen-cluster,
author = "S. van Dongen",
title = "A Cluster Algorithm for Graphs",
url = "citeseer.ist.psu.edu/vandongen00cluster.html" }
Citations (may not include all citations):121 Recent directions in netlist partitioning: a survey (context) - Alpert, Kahng
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC