Efficient Computation of Maximum Flexi-Clique in Networks
This new graph model could revolutionize how we analyze social networks and fraud rings.
Researchers have introduced the 'Flexi-Clique' model, a new method for discovering large, cohesive subgraphs in complex networks like social media or financial systems. Unlike older models with fixed density thresholds, Flexi-Clique allows connectivity to decay naturally as group size increases. The team developed two algorithms: FPA, a fast heuristic achieving near-optimal results, and EBA, an exact framework. Experiments on large real-world networks show both methods are practical and scalable for mining meaningful subgraphs.
Why It Matters
This enables more accurate detection of real-world communities, fraud rings, and influencer groups hidden within massive datasets.