Jean-Xavier Rampon

Learn More
Habib, H., M. Morvan and J.-X. Rampon, On the calculation of transitive reduction-closure of orders, Discrete Mathematics 111 (1993) 289-303. Computations of transitive closure and reduction ofdirected acyclic graphs are mainly considered in this paper. Classes of directed acyclic graphs for which such problems can be solved in linear time complexity (in(More)
This report presents a database of about graph invariants for deriving systematically necessary conditions from the graph properties based representation of global constraints. This scheme is based on invariants on the graph characteristics used in the description of a global constraint. A SICStus Prolog implementation based on arithmetic and logical(More)
Partially ordered sets appear as a basic tool in computer science and are particularly accurate for modeling dynamic behavior of complex systems. Motivated by considerations on the diagnosis of distributed computations a new kind of algorithm on posets has been developed and is now widely considered. In this paper we present this “on-line” algorithmics on(More)