Research Article
[Retracted] Personalized Influential Community Search in Large Networks: A K-ECC-Based Model
Algorithm 2
Dichotomy-based algorithm
| | Input:: a graph, : query vertices, : a positive integer | | | Output: PIKE for the query | | (1) | Compute KECCs | | (2) | the -ECC in containing | | (3) | Ifthen return error | | (4) | vertices of with weight smaller than and sort vertices in the ascending order according to the weights | | (5) | whiledo | | (6) | the first half of vertices in | | (7) | the second half of vertices in | | (8) | remove from | | (9) | Compute KECCs | | (10) | the -ECC in containing | | (11) | ifthen | | (12) | ifthen break; | | (13) | | | (14) | else | | (15) | ; | | (16) | return |
|