1. Aho, A., Garey, M., Ullman, J.: The transitive reduction of a directed graph. SIAM J. Comput. 1(2), 131–137 (1972). https://doi.org/10.1137/0201008
2. Andrews, S.: A ‘best-of-breed’ approach for designing a fast algorithm for computing fixpoints of Galois connections. Inf. Sci. 295, 633–649 (2015). https://doi.org/10.1016/j.ins.2014.10.011
3. Andrews, S., Hirsch, L.: A tool for creating and visualising formal concept trees. In: Andrews, S., Polovina, S. (eds.) Proceedings of 5th Conceptual Structures Tools & Interoperability Workshop (CSTIW), pp. 1–9 (2016). http://ceur-ws.org/Vol-1637/
4. Bordat, J.: Calcul pratique du trellis de Galois d’une correspondance. Mathematiques, Informatiques et Sciences Humaines 24(94), 31–47 (1986)
5. Carpineto, C., Romano, G.: Concept Data Analysis: Theory and Applications. Wiley, New York (2004). https://doi.org/10.1002/0470011297