[Lemon-user] k-means-like planar graph partitioning

[Tim Keitt]

I am interested in an algorithm that divides up a planar graph into regions
where the regions are "optimal" in some sense (eg minimize the distances to
the median node within each cluster). I would like to identify these
clusters adaptively a la k-means where the centroids converge over
iterations. I have seen related ideas in the literature (normalized cuts)
but am wondering if there is a solution or partial solution already in
lemon. Can the Gomory-Hu tree be used for this? Any pointers appreciated.

THK

http://www.keittlab.org/
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lemon.cs.elte.hu/pipermail/lemon-user/attachments/20150607/d33e5e41/attachment.html>