On solving simplified diversified top-k s-plex problem

Jun Wu, Chu-Min Li, Luzhi Wang, Shuli Hu, Peng Zhao, Minghao Yin

Abstract: Highlights•A new NP-hardness problem, named simplified diversified top-k s-plex (S-DTKSP) problem.•The integer linear programming formulations for S-DTKSP problem.•The algorithm uses tabu search and s-plex scoring strategy for S-DTKSP problem.•Experiments show that the proposed algorithm performs very well than the baseline algorithms and CPLEX on the real-world graphs.