[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[igraph] graph partitioning in K groups

From: Claudio Martella
Subject: [igraph] graph partitioning in K groups
Date: Mon, 19 Dec 2011 12:16:28 +0100


I need to partition a weighted undirected graph topologically in a set
of K groups, something like k-means. all i can find is
community-detection without the possibility to specify K.
Can anybody give me a reference for a way of doing this in igraph or
in case to an algorithm that does so I can implement myself?


   Claudio Martella

reply via email to

[Prev in Thread] Current Thread [Next in Thread]