Alain Bretto

Learn More
Finding hypergraph transversals is a major algorithmic issue which was shown having many connections with the data mining area. In this paper, by defining a new Galois connection, we show that this problem is closely related to the mining of the so-called condensed representations of frequent patterns. This data mining formalization enables us to benefit(More)
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to decrease the algorithmic complexity of problems by using the factorization of the product. Hypergraphs were introduced as a generalization of graphs and the definition of Cartesian products extends naturally to them. In this paper, we give new properties and(More)
On one hand the graph isomorphism problem (GI) has received considerable attention due to its unresolved complexity status and its many practical applications. On the other hand a notion of compatible topologies on graphs has emerged from digital topology (see [5, 7, 17, 9, 14, 16]). In this article we study GI from the topological point of view. Firstly we(More)