A Hybrid Metaheuristic for the Maximum k-Plex Problem

被引：7
|
作者：
Gujjula, Krishna Reddy [1 ]
Seshadrinathan, Krishnan Ayalur [1 ]
Meisami, Amirhossein [1 ]
机构：
[1] Texas A&M Univ, Dept Ind & Syst Engn, 3131 TAMU, College Stn, TX 77843 USA
来源：
EXAMINING ROBUSTNESS AND VULNERABILITY OF NETWORKED SYSTEMS | 2014年 / 37卷
关键词：
social network analysis; clique relaxations; k-plex; CLIQUE RELAXATION MODELS;
D O I：
10.3233/978-1-61499-391-9-83
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Social network analysis is an area of research that is gathering interest and importance since the turn of the century, especially with increased technology proliferation. Graph theory is predominantly being used in the analysis of social networks. The maximum k-plex problem. which belongs to the category of clique relaxation problems has been studied by researchers in this field. This problem is known to be NP-hard. This paper proposes an amalgamation of a greedy randomized adaptive search procedure and tabu search metaheuristic to solve the problem. The performance of the proposed hybrid metaheuristic is tested on well-known instances of graphs and the computational results are reported.
引用
收藏
页码：83 / 92
页数：10
相关论文
共 50 条
  • [11] A New Upper Bound Based on Vertex Partitioning for the Maximum k-plex Problem
    Jiang, Hua
    Zhu, Dongming
    Xie, Zhichao
    Yao, Shaowen
    Fu, Zhang-Hua
    PROCEEDINGS OF THE THIRTIETH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2021, 2021, : 1689 - 1696
  • [12] The Maximum Influence k-Plex Problem and its Branch-and-Bound Algorithm
    Peng, Liangyao
    Cheng, Xue
    Zheng, Zhifei
    Tang, Zhongyou
    Jiang, Hua
    INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS, 2024, 33 (08)
  • [13] A New Upper Bound Based on Vertex Partitioning for the Maximum k-plex Problem
    Jiang, Hua
    Zhu, Dongming
    Xie, Zhichao
    Yao, Shaowen
    Fu, Zhang-Hua
    IJCAI International Joint Conference on Artificial Intelligence, 2021, : 1689 - 1696
  • [14] Detecting Maximum k-Plex with Iterative Proper l-Plex Search
    Okubo, Yoshiaki
    Matsudaira, Masanobu
    Haraguchi, Makoto
    DISCOVERY SCIENCE, DS 2014, 2014, 8777 : 240 - 251
  • [15] Reinforcement learning based coarse-to-fine search for the maximum k-plex problem
    Jin, Yan
    Drake, John H.
    He, Kun
    Benlic, Una
    APPLIED SOFT COMPUTING, 2022, 131
  • [16] Vertex Selection Heuristics in Branch-and-Bound Algorithms for the Maximum k-Plex Problem
    Wu, Kuixian
    Gao, Jian
    Chen, Rong
    Cui, Xianji
    INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS, 2019, 28 (05)
  • [17] Efficient Maximum k-Plex Computation over Large Sparse Graphs
    Chang, Lijun
    Xu, Mouyi
    Strash, Darren
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2022, 16 (02): : 127 - 139
  • [18] A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap
    Wang, Zhengren
    Zhou, Yi
    Luo, Chunyu
    Xiao, Mingyu
    PROCEEDINGS OF THE THIRTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2023, 2023, : 5648 - 5656
  • [19] Maximum k-Plex Search: An Alternated Reduction-and-Bound Method
    Gao, Shuohao
    Liu, Shengxin
    Yu, Kaiqiang
    Long, Cheng
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2024, 18 (02): : 363 - 376
  • [20] Fast Maximum k-Plex Algorithms Parameterized by Small Degeneracy Gaps
    Wang, Zhengren
    Zhou, Yi
    Luo, Chunyu
    Xiao, Mingyu
    Hao, Jin-Kao
    arXiv, 2023,
12345