Back to Search
Start Over
An incremental algorithm for computing the transversal hypergraph.
- Source :
-
Annales Mathematicae et Informaticae . 2023, Vol. 58, p147-159. 13p. - Publication Year :
- 2023
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
- Subjects :
- *HYPERGRAPHS
*TRANSVERSAL lines
*ALGORITHMS
Subjects
Details
- Language :
- English
- ISSN :
- 17875021
- Volume :
- 58
- Database :
- Academic Search Index
- Journal :
- Annales Mathematicae et Informaticae
- Publication Type :
- Academic Journal
- Accession number :
- 174359860
- Full Text :
- https://doi.org/10.33039/ami.2023.08.007