Article Dans Une Revue Discrete Applied Mathematics Année : 2018

A Depth-first Search Algorithm for Computing Pseudo-closed Sets

Résumé

The question of the lower bounds for the delay in the computation of the Duquenne-Guigues implication basis in non-lectic orders is still open. As a step towards an answer, we propose an algorithm that can enumerate pseudo-closed sets in orders that do not necessarily extend the inclusion order using depth-first searches in a sequence of closure systems. Empirical comparisons with NextClosure on the runtime and number of closed sets computed are provided.

Fichier principal
Vignette du fichier
ArticleDAM.pdf (169.29 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-01706373 , version 1 (11-02-2018)

Licence

Identifiants

  • HAL Id : hal-01706373 , version 1

Citer

Alexandre Bazin. A Depth-first Search Algorithm for Computing Pseudo-closed Sets. Discrete Applied Mathematics, 2018. ⟨hal-01706373⟩
195 Consultations
1681 Téléchargements

Partager

  • More