A Swap-Based Heuristic Algorithm for the Maximum k-Plex Problem

Sun Yuan Hsieh, Shih Shun Kao, Yu Sheng Lin

研究成果: Article同行評審

2 引文 斯高帕斯(Scopus)

摘要

The maximum k-plex problem is intended to relax the clique definition with maximum cardinality. It helps people understand the structures of networks by considering them a problem of graph clustering; therefore, it is a useful model for social network analysis. In this paper, we propose a swap-based heuristic algorithm for the maximum k-plex problem. Starting with a randomly selected solution, we use three types of swap operators to enlarge our current solution in different situations. The results of experiments conducted on various graphs from two benchmarks demonstrated that our proposed algorithm achieved desirable performance on specific graphs compared with other algorithms.

原文English
文章編號8794502
頁(從 - 到)110267-110278
頁數12
期刊IEEE Access
7
DOIs
出版狀態Published - 2019

All Science Journal Classification (ASJC) codes

  • 電腦科學(全部)
  • 材料科學(全部)
  • 工程 (全部)

指紋

深入研究「A Swap-Based Heuristic Algorithm for the Maximum k-Plex Problem」主題。共同形成了獨特的指紋。

引用此