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 条
  • [1] Colouring Clique-Hypergraphs of Circulant Graphs
    C. N. Campos
    S. Dantas
    C. P. de Mello
    Graphs and Combinatorics, 2013, 29 : 1713 - 1720
  • [2] Colouring Clique-Hypergraphs of Circulant Graphs
    Campos, C. N.
    Dantas, S.
    de Mello, C. P.
    GRAPHS AND COMBINATORICS, 2013, 29 (06) : 1713 - 1720
  • [3] Benchmark Problems for Exhaustive Exact Maximum Clique Search Algorithms
    Szabo, Sandor
    Zavalnij, Bogdan
    INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS, 2019, 43 (02): : 177 - 186
  • [4] Score sequences in oriented k-hypergraphs
    Pirzada, S.
    Zhou Guofei
    EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2008, 1 (03): : 10 - 20
  • [5] Degree sequence of oriented k-hypergraphs
    Zhou, Guofei
    Pirzada, S.
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2008, 27 (1-2) : 149 - 158
  • [6] k-HYPERGRAPHS WITH REGULAR AUTOMORPHISM GROUPS
    Jajcay, R.
    Jajcayova, T. B.
    ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 2019, 88 (03): : 835 - 840
  • [7] l-Covering k-Hypergraphs are Quasi-Eulerian
    Sajna, Mateja
    Wagner, Andrew
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2023, 43 (04) : 1091 - 1102
  • [8] Iterated k-opt local search for the maximum clique problem
    Katayama, Kengo
    Sadamatsu, Masashi
    Narihisa, Hiroyuki
    EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2007, 4446 : 84 - +
  • [9] A continuous characterization of the maximum vertex-weighted clique in hypergraphs
    Qingsong Tang
    Xiangde Zhang
    Guoren Wang
    Cheng Zhao
    Journal of Combinatorial Optimization, 2018, 35 : 1250 - 1260
  • [10] On the maximum number of edges in hypergraphs with fixed matching and clique number
    Frankl, Peter
    Liu, Erica L. L.
    Wang, Jian
    EUROPEAN JOURNAL OF COMBINATORICS, 2022, 106
12345