Learn More
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 accordance with the number of arcs) are(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)