Efficient Computation of Maximum Flexi-Clique in Networks

Abstract: Discovering large cohesive subgraphs is a key task for graph mining. Existing models, such as clique, k-plex, and γ-quasi-clique, use fixed density thresholds that overlook the natural decay of connectivity as the subgraph size increases. The Flexi-clique model overcomes this limitation by imposing a degree constraint that grows sub-linearly with subgraph size. We provide the algorithmic study of Flexi-clique, proving its NP-hardness and analysing its non-hereditary properties. To address its computational challenge, we propose the Flexi-Prune Algorithm FPA, a fast heuristic using core-based seeding and connectivity-aware pruning, and the Efficient Branch-and-Bound Algorithm EBA, an exact framework enhanced with multiple pruning rules. Experiments on large real-world and synthetic networks demonstrate that FPA achieves near-optimal quality at much lower cost, while EBA efficiently computes exact solutions. Flexi-clique thus provides a practical and scalable model for discovering large, meaningful subgraphs in complex networks.

• The paper establishes NP-hardness and constant-factor inapproximability for maximum Flexi-clique, showing that practical solutions must rely on heuristics or exact search without approximation guarantees.
• The paper introduces Flexi-Prune and an efficient branch-and-bound algorithm with six pruning rules, achieving near-optimal heuristic solutions and practical exact runtimes on networks with up to one million nodes.
• The paper shows that the size-adaptive degree threshold captures declining community density more accurately than cliques, k-plexes, and quasi-cliques in real and temporal networks.

The Flexi-clique model relaxes the clique requirement by imposing a minimum degree constraint of $\lfloor |H|^\tau \rfloor$ on an induced subgraph $G[H]$, where $\tau \in [0,1)$, together with a connectivity requirement. Because this threshold grows sub-linearly with subgraph size, the model captures the empirically observed decay of internal connectivity as real-world communities grow — a pattern that fixed-threshold models such as cliques, $k$-plexes, and $\gamma$-quasi-cliques cannot express. This paper provides the first formal algorithmic treatment of the maximum Flexi-clique problem: it establishes NP-hardness and constant-factor inapproximability, characterizes the model's non-hereditary structure, and introduces both a fast heuristic (FPA) and the first exact branch-and-bound algorithm (EBA) (2602.10459).

Motivation and problem formulation

The authors motivate the model through three design requirements for size-adaptive cohesion: cohesion should be enforced at the node level rather than as a global density average; degree requirements should increase with subgraph size but sub-linearly; and connectivity must be preserved to avoid fragmented solutions. Empirical plots on DBLP and Amazon show that community size versus average degree follows sub-linear growth, whereas clique, $k$-plex, and $\gamma$-quasi-clique all imply linearly growing degree thresholds (with slope 1, 1, and $\gamma$, respectively). The Flexi-clique threshold $\lfloor |H|^\tau \rfloor$ matches the observed trend. A 50-node subgraph under $\tau = 0.9$ requires minimum degree 34 (about 68% connectivity), placing the effective density in the range typically used for quasi-clique mining.

Formally, given $G[H]$0 and $G[H]$1, a Flexi-clique is a node set $G[H]$2 such that $G[H]$3 and $G[H]$4 is connected; the maximum Flexi-clique problem seeks the largest such $G[H]$5. The decision version is NP-hard via reduction from clique.

Theoretical properties

Two structural results drive the algorithmic design. First, the paper proves that the maximum Flexi-clique problem admits no constant-factor approximation unless P=NP, via a gap-preserving reduction from gap clique: each original node is blown up into a clique block of size $G[H]$6 polynomial in $G[H]$7, blocks are fully adjacent exactly when their originals are adjacent, and $G[H]$8 is set to $G[H]$9. In YES instances OPT is at least $\tau \in [0,1)$0; in NO instances every Flexi-clique has size at most $\tau \in [0,1)$1, yielding a constant gap. This is a strong negative result: unlike maximum $\tau \in [0,1)$2-plex or quasi-clique, no approximation algorithm with any constant guarantee can exist for Flexi-clique, so practical algorithms must be exact branch-and-bound or heuristics without guarantees.

Second, the model is shown to be neither hereditary nor quasi-hereditary: removing a single node from a valid Flexi-clique can violate the threshold when $\tau \in [0,1)$3. The authors argue this non-heredity is inherent to any sub-linear, size-dependent constraint rather than a modelling flaw. Its consequence is significant: the absence of an $\tau \in [0,1)$4-sized Flexi-clique does not preclude larger ones, so classical enumeration frameworks that rely on downward closure are inapplicable. Moreover, unlike $\tau \in [0,1)$5-plexes (connected for $\tau \in [0,1)$6) and $\tau \in [0,1)$7-quasi-cliques ($\tau \in [0,1)$8), which then have diameter at most two, Flexi-clique admits no parameter-dependent bound on connectivity or diameter. All four structural assumptions underlying existing branch-and-bound designs fail simultaneously.

The Flexi-Prune Algorithm

FPA is a two-stage heuristic. In the seeding stage, it computes the $\tau \in [0,1)$9-core decomposition and increments $k$0 until the largest connected component (LCC) of the $k$1-core satisfies the Flexi-clique condition, then confines search to the enclosing $k$2-core. This exploits two observations: real networks have power-law degree distributions, so peripheral nodes cannot meet the threshold, and the LCC ratio within cores stays close to one as $k$3 grows. In the peeling stage, FPA repeatedly removes the lowest-degree node that is not an articulation point, updating degrees and re-evaluating the threshold, until the remaining subgraph is feasible. Connectivity checks use a fully dynamic connectivity structure (Holm–de Lichtenberg–Thorup forests over link-cut trees), avoiding component recomputation per removal.

The worst-case complexity is $k$4, dominated by the peeling phase's articulation checks; the authors note that in practice articulation checks occur $k$5 times rather than $k$6, yielding near-linear scaling on sparse graphs.

The Efficient Branch-and-Bound Algorithm

EBA organizes the search around four disjoint sets at each search node: the partial set $k$7 (required to induce a connected subgraph), reachable candidates $k$8 adjacent to $k$9, unreachable candidates $\gamma$0, and the exclusion set $\gamma$1. Its connectivity-preserving branching (CP) extends $\gamma$2 only by nodes from $\gamma$3 (or from $\gamma$4 at the root), migrating neighbors of the added node from $\gamma$5 into $\gamma$6; excluded nodes propagate monotonically to descendants and later siblings. Two monotonicity properties — monotonic exclusion of $\gamma$7 and monotonic expansion of $\gamma$8 — underpin sound pruning.

Six pruning rules make EBA practical:

• Rule 1 (degree-based): prune if $\gamma$9, where $k$0 is the adjusted degree within the current scope and $k$1 derives from Lemma 1's bound $k$2.
• Rule 2: prune when $k$3 has reached its theoretical size bound $k$4 without being feasible.
• Rules 3–4 (diameter-based): exploit the degree–diameter lower bound $k$5 on the size of a graph with minimum degree $k$6 and diameter $k$7; candidates too distant from $k$8 to fit a feasible subgraph are discarded. Distances are maintained incrementally via one single-source shortest-path computation per branching step.
• Rule 5 (follower-based): excluding a node lowers adjusted degrees of its neighbors, cascading further exclusions ("followers") applied iteratively to a stable state.
• Rule 6 (heuristic-based): FPA initializes $k$9, and any node with global degree below $\gamma$0 is removed; filtering is reapplied whenever $\gamma$1 improves.

Candidate ordering matters: nodes are branched in ascending degree order, which the ablation shows yields roughly a $\gamma$2 average speedup over ID-based ordering, and is necessary for termination on DBLP.

Experimental evaluation

Experiments cover nine KONECT networks (34 nodes to 1.07M edges, including Amazon, DBLP, and Florida), LFR synthetic graphs, and a temporal case study, with default $\gamma$3.

Heuristic quality: FPA finds optimal solutions on DBLP for all tested $\gamma$4 values and approximation ratios above 90% on most datasets; even on the hardest networks (Erdős, Florida) it averages 82% and 75% of optimum respectively. These strong initial bounds directly accelerate EBA.

Efficiency: FPA outperforms the prior heuristic NPA across most datasets — e.g., 7.0s vs. 128.8s on Amazon and 10.6s vs. 69.6s on DBLP — attributable to incremental articulation-point maintenance rather than full rescans. EBA remains practical despite exhaustive search (16.5s on Amazon, 19.9s on DBLP, 23.7s on Florida), and achieves running times comparable to FastQC for quasi-cliques even though FastQC benefits from a bounded-diameter guarantee that Flexi-clique lacks.

Effect of $\gamma$5: running time shows no consistent trend with increasing $\gamma$6 across datasets (it grows consistently only on Erdős), which the authors attribute to dataset-specific sparsity and degree distribution effects on pruning efficiency. Solution size, however, decreases consistently as $\gamma$7 increases.

Scalability: on LFR networks up to 1M nodes, FPA finishes within two seconds with near-linear scaling, and EBA's runtime grows near-linearly with network size and average degree without explosive growth.

Ablation: Rule 6 (heuristic initialization) has the largest impact — without it, DBLP, Florida, and Polblogs fail to terminate within 48 hours. Degree-based and follower-based rules contribute more than diameter-based rules because they terminate branches outright rather than merely shrinking candidate sets.

Case study: on the Eu-mail temporal network with ground-truth communities, Flexi-clique tracks the empirical density trajectory of growing communities more closely than clique, $\gamma$8-plex, and $\gamma$9-quasi-clique across five distributional distance metrics (Wasserstein, Jensen–Shannon, total variation, symmetric KL, median absolute difference). Cliques have constant density 1.0 and $\gamma$0-plex densities converge to 1.0, while quasi-cliques impose a fixed threshold; only the size-adaptive constraint reproduces the natural density decline.

Limitations and open questions

The paper concedes several boundaries of its results. The inapproximability proof rules out constant-factor guarantees, leaving heuristic quality unquantified in theory; FPA's observed near-optimality is empirical only. The claimed near-linear practical scaling of FPA rests on the assumption that articulation checks occur $\gamma$1 times, which holds on sparse real networks but not in general. EBA's efficiency depends heavily on the quality of the FPA-initialized bound, as the ablation demonstrates, and the effect of $\gamma$2 on runtime is dataset-dependent and not characterized analytically. Open questions stated by the authors include extending Flexi-clique to dynamic and attributed graphs, and enumerating maximal Flexi-cliques, which they note requires new algorithmic principles beyond those used for classical cohesive subgraph enumeration precisely because of the model's non-hereditary and connectivity-preserving nature.

Conclusion

This work converts the Flexi-clique model from an empirically motivated proposal into a theoretically grounded and computationally tractable framework. It establishes NP-hardness and constant-factor inapproximability, proves that non-heredity is intrinsic to sub-linear size-adaptive constraints, and delivers a connectivity-preserving branch-and-bound scheme with six pruning rules together with a scalable core-based heuristic. Empirically, FPA attains near-optimal solutions at a fraction of prior cost, EBA computes exact optima efficiently on large sparse graphs, and the model best reproduces the density evolution of real communities among compared cohesive subgraph models.