Calcul pratique du treillis de Galois d'une correspondance
Mathématiques et sciences humaines, Tome 96 (1986), pp. 31-47. 
@article{MSH_1986__96__31_0,
     author = {Bordat, J. P.},
     title = {Calcul pratique du treillis de {Galois} d'une correspondance},
     journal = {Math\'ematiques et sciences humaines},
     pages = {31--47},
     publisher = {Ecole Pratique des hautes \'etudes, Centre de math\'ematique sociale et de statistique},
     volume = {96},
     year = {1986},
     mrnumber = {878296},
     zbl = {0626.06007},
     language = {fr},
     url = {http://archive.numdam.org/item/MSH_1986__96__31_0/}
}
TY  - JOUR
AU  - Bordat, J. P.
TI  - Calcul pratique du treillis de Galois d'une correspondance
JO  - Mathématiques et sciences humaines
PY  - 1986
SP  - 31
EP  - 47
VL  - 96
PB  - Ecole Pratique des hautes études, Centre de mathématique sociale et de statistique
UR  - http://archive.numdam.org/item/MSH_1986__96__31_0/
LA  - fr
ID  - MSH_1986__96__31_0
ER  - 
%0 Journal Article
%A Bordat, J. P.
%T Calcul pratique du treillis de Galois d'une correspondance
%J Mathématiques et sciences humaines
%D 1986
%P 31-47
%V 96
%I Ecole Pratique des hautes études, Centre de mathématique sociale et de statistique
%U http://archive.numdam.org/item/MSH_1986__96__31_0/
%G fr
%F MSH_1986__96__31_0
Bordat, J. P. Calcul pratique du treillis de Galois d'une correspondance. Mathématiques et sciences humaines, Tome 96 (1986), pp. 31-47. http://archive.numdam.org/item/MSH_1986__96__31_0/

1 - Aho A.V., Hopcroft J.E., Ullmann J.D., Data structures and algorithms, Reading, Addison-Wesley, 1983. | MR | Zbl

2 - Barbut M., Monjardet B., Ordre et Classification, Algèbre et Combinatoire,2 tomes, Paris, Hachette, 1970. | Zbl

3 - Berge C., Graphes et hypergraphes, Paris, Dunod, 1970. | MR | Zbl

4 - Chein M., "Algorithme de recherche des sous-matrices premières d' une matrice ", Bull. Math. Soc. Sci. Math. R. S. Roumanie, tome 13 (61)(1969), 21-25. | MR | Zbl

5 - Fay G., "An algorithm for finite Galois connections", CL & CL-Comput. Linguist. Comput. Lang. 10 (1975), 99-123. | MR | Zbl

6 - Fischer M.J., Meyer A.R., "Boolean matrix multiplication and transitive closure", Proc. 12th Annual Symposium on Switching and Automata Theory (1971), 129-131.

7 - Ganter B., "Two basic algorithms in concept analysis", Preprint nº 831, Technische Hochschule Darmstadt (1984). | MR

8 - Habib M., Hamroun M., Jegou R.," Linear equivalences for transitivity in graphs", Rapp. Rech. nº 83-10, E.N.S.M. Saint-Etienne (1983).

9 - Haralick R.M., "The diclique representation and decomposition of binary relations", J. Assoc. Comput. Mach. 21 (1974), 356-366. | MR | Zbl

10 - Karp R.M., "Complexity of computer computations", Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown heights, N. Y. (1972), 85-103. | MR

11 - Knuth D.E., Big Omicron and Big Omega and Big Theta, Sigact News (1976), 18-25.

12 - Munro I., "Efficient determination of the transitive closure of a directed graph ", Information Processing letters, 1 (1971), 56-58. | Zbl

13 - Norris E.M., "An algorithm for computing the maximal rectangles of a binary relation", Rev. Roum. Math. Pures Appl., 23, nº 2 (1978), 243-250. | MR | Zbl

14 - Wille R., "Restructuring lattice theory : an approach based on hierarchies of concepts" in Ordered sets (edit. I. Rival), Reidel, Dordrecht -Boston (1982), 445-470. | MR | Zbl

15 - Wille R., "Line diagrams of hierarchical concept systems", Int. Classif. 11, 2 (1984), 77-86.