An incremental algorithm for computing the transversal hypergraph

被引：0
|
作者：
Szathmary, Laszlo [1 ]
机构：
[1] Univ Debrecen, Fac Informat, Debrecen, Hungary
来源：
ANNALES MATHEMATICAE ET INFORMATICAE | 2023年 / 58卷
关键词：
D O I：
10.33039/ami.2023.08.007
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper we present an incremental algorithm for computing the transversal hypergraph. Our algorithm is an optimized version of Berge's algorithm [2] for solving the transversal hypergraph problem. The original algorithm of Berge is the simplest and most direct scheme for generating all minimal transversals of a hypergraph. Here we present an optimized version of Berge's algorithm that we call BergeOpt. We show that BergeOpt can significantly reduce the number of expensive inclusion tests.
引用
收藏
页码：147 / 159
页数：13
相关论文
共 50 条
  • [1] Evaluation of an algorithm for the Transversal Hypergraph Problem
    Kavvadias, DJ
    Stavropoulos, EC
    [J]. ALGORITHM ENGINEERING, 1999, 1668 : 72 - 84
  • [2] A new algorithm for the hypergraph transversal problem
    Khachiyan, L
    Boros, E
    Elbassioni, K
    Gurvich, V
    [J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2005, 3595 : 767 - 776
  • [3] A global parallel algorithm for the hypergraph transversal problem
    Khachiyan, Leonid
    Boros, Endre
    Elbassioni, Khaled
    Gurvich, Vladimir
    [J]. INFORMATION PROCESSING LETTERS, 2007, 101 (04) : 148 - 155
  • [4] Incremental Algorithm for Minimum Cut and Edge Connectivity in Hypergraph
    Gupta, Rahul Raj
    Karmakar, Sushanta
    [J]. COMBINATORIAL ALGORITHMS, IWOCA 2019, 2019, 11638 : 237 - 250
  • [5] A Hybrid Hypergraph Partitioning Algorithm for Scientific Computing
    Zeng Yao-yuan
    Zhao Wen-tao
    Wang Zheng-hua
    [J]. MATERIALS PROCESSING AND MANUFACTURING III, PTS 1-4, 2013, 753-755 : 2900 - +
  • [6] TRANSVERSAL NUMBER OF UNIFORM HYPERGRAPH
    STERBOUL, F
    [J]. DISCRETE MATHEMATICS, 1978, 22 (01) : 91 - 96
  • [7] An incremental algorithm for computing ranked full disjunctions
    Cohen, Sara
    Sagiv, Yehoshua
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2007, 73 (04) : 648 - 668
  • [8] Limitations on Transversal Gates for Hypergraph Product Codes
    Burton, Simon
    Browne, Dan
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (03) : 1772 - 1781
  • [9] On transversal hypergraph enumeration in mining sequential patterns
    Li, Dong
    Laurent, Anne
    Teisseire, Maguelonne
    [J]. IDEAS 2007: 11TH INTERNATIONAL DATABASE ENGINEERING AND APPLICATIONS SYMPOSIUM, PROCEEDINGS, 2007, : 303 - +
  • [10] A Lower Bound for the HBC Transversal Hypergraph Generation
    Elbassioni, Khaled
    Hagen, Matthias
    Rauf, Imran
    [J]. FUNDAMENTA INFORMATICAE, 2014, 130 (04) : 409 - 414
12345