Skip navigation
Help

Maximal k-Edge-Connected Subgraphs from a Graph - Implementation

I came across this paper: http://www.edbt.org/Proceedings/2012-Berlin/papers/edbt/a36-zhou.pdf while doing a course on SNA (Social Network Analysis). I want to detect communities using mutual friend info on fb data. I want to find out if there is a good implementation of the naive approach to finding maximal k-Edge-Connected subgraphs from a graph. Algorithm enthusiasts of Reddit, could you please point me to any?

submitted by kripaks
[link] [comment]