Skip to Main content Skip to Navigation
Journal articles

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

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Alexandre Bazin Connect in order to contact the contributor
Submitted on : Sunday, February 11, 2018 - 4:55:21 PM
Last modification on : Sunday, June 26, 2022 - 9:36:46 AM
Long-term archiving on: : Sunday, May 6, 2018 - 7:36:14 AM


Files produced by the author(s)


  • HAL Id : hal-01706373, version 1


Alexandre Bazin. A Depth-first Search Algorithm for Computing Pseudo-closed Sets. Discrete Applied Mathematics, Elsevier, 2018. ⟨hal-01706373⟩



Record views


Files downloads