A depth-first search algorithm for computing pseudo-closed sets-Reference-Cited by-同舟云学术

A depth-first search algorithm for computing pseudo-closed sets

Author:

Bazin Alexandre

Funder

European Regional Development Fund (ERDF)

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference20 articles.

1. Recognizing Pseudo-intents is coNP-complete;Babin,2010

3. Comparing performance of algorithms for generating the Duquenne-Guigues basis;Bazhanov,2011

4. Computing the Duquenne-Guigues basis: An algorithm for choosing the order;Bazin;Int. J. Gen. Syst.,2015

5. Algorithms for k-meet-semidistributive lattices;Beaudou;Theoret. Comput. Sci.,2015

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Description lattices of generalised convex hulls;International Journal of Approximate Reasoning;2024-11

2. Improved A-star algorithm based on multivariate fusion heuristic function for autonomous driving path planning;Proceedings of the Institution of Mechanical Engineers, Part D: Journal of Automobile Engineering;2022-06-04

5. Autonomous driving path planning algorithm based on improved A* algorithm in unstructured environment;Proceedings of the Institution of Mechanical Engineers, Part D: Journal of Automobile Engineering;2020-10-02