Maximum Clique Exhaustive Search in Circulant k-Hypergraphs

被引：0
|
作者：
Plant, Lachlan [1 ]
Moura, Lucia [1 ]
机构：
[1] Univ Ottawa, Sch Elect Engn & Comp Sci, Ottawa, ON, Canada
来源：
COMBINATORIAL ALGORITHMS, IWOCA 2019 | 2019年 / 11638卷
基金：
加拿大自然科学与工程研究理事会;
关键词：
ALGORITHM;
D O I：
10.1007/978-3-030-25005-8_31
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper, we discuss two algorithms to solve the maximum clique problem in circulant k-hypergraphs, and do an experimental comparison between them. The first is the Necklace algorithm proposed by Tzanakis, Moura, Panario and Stevens [11] which uses an algorithm to generate binary necklaces by Ruskey, Savage and Wang [10]. The second algorithm is a new algorithm which we call Russian Necklace that is based on a Russian doll search for maximum cliques by Ostergard [6] with extra pruning that takes advantages of properties specific to circulant k-hypergraphs. Our experiments indicate that the new algorithm is more effective for hypergraphs with higher edge density.
引用
收藏
页码：378 / 392
页数：15
相关论文
共 50 条
  • [31] Coloring clique-hypergraphs of graphs with no subdivision of K5
    Shan, Erfang
    Kang, Liying
    THEORETICAL COMPUTER SCIENCE, 2015, 592 : 166 - 175
  • [32] Relaxed approximate coloring in exact maximum clique search
    San Segundo, Pablo
    Tapia, Cristobal
    COMPUTERS & OPERATIONS RESEARCH, 2014, 44 : 185 - 192
  • [33] Coloring clique-hypergraphs of graphs with no subdivision of K5
    Shan, Erfang
    Kang, Liying
    Theoretical Computer Science, 2015, 592 : 166 - 175
  • [34] Diversified Top-K Clique Search
    Yuan, Long
    Qin, Lu
    Lin, Xuemin
    Chang, Lijun
    Zhang, Wenjie
    2015 IEEE 31ST INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2015, : 387 - 398
  • [35] Diversified top-k clique search
    Long Yuan
    Lu Qin
    Xuemin Lin
    Lijun Chang
    Wenjie Zhang
    The VLDB Journal, 2016, 25 : 171 - 196
  • [36] Diversified top-k clique search
    Yuan, Long
    Qin, Lu
    Lin, Xuemin
    Chang, Lijun
    Zhang, Wenjie
    VLDB JOURNAL, 2016, 25 (02): : 171 - 196
  • [37] Improved initial vertex ordering for exact maximum clique search
    Pablo San Segundo
    Alvaro Lopez
    Mikhail Batsyn
    Alexey Nikolaev
    Panos M. Pardalos
    Applied Intelligence, 2016, 45 : 868 - 880
  • [38] An Efficient Local Search for the Maximum Edge Weighted Clique Problem
    Li, Ruizhi
    Wu, Xiaoli
    Liu, Huan
    Wu, Jun
    Yin, Minghao
    IEEE ACCESS, 2018, 6 : 10743 - 10753
  • [39] Improved initial vertex ordering for exact maximum clique search
    San Segundo, Pablo
    Lopez, Alvaro
    Batsyn, Mikhail
    Nikolaev, Alexey
    Pardalos, Panos M.
    APPLIED INTELLIGENCE, 2016, 45 (03) : 868 - 880
  • [40] Genetic, iterated and multistart local search for the maximum clique problem
    Marchiori, E
    APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS, 2002, 2279 : 112 - 121
12345