ALGORITHMUS. XXVI. AN ALGORITHM FOR FINDING THE TRANSITIVE CLOSURE OF A DIGRAPH.DZIKIEWICZ J.1975; COMPUTING; AUSTR.; DA. 1975; VOL. 15; NO 1; PP. 75-79; ABS. ALLEM.; BIBL. 3 REF.Article

Un langage graphique pour l'interrogation de réseaux : application aux bases de données géographiquesMainguenaud, Michel; Gardarin, Georges.1989, 290 p.Thesis

A linear expected-time algorithm for deriving all logical conclusions implied by a set of Boolean inequalitiesHANSEN, P; JAUMARD, B; MINOUX, M et al.Mathematical programming. 1986, Vol 34, Num 2, pp 223-231, issn 0025-5610Article

A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion)ROTE, G.Computing (Wien. Print). 1985, Vol 34, Num 3, pp 191-219, issn 0010-485XArticle

Formality worksHOOGERWOORD, Rob R.Information processing letters. 2001, Vol 77, Num 2-4, pp 137-142, issn 0020-0190Article

An algorithm for transitive reduction of an acyclic graphGRIES, D; MARTIN, A. J; VAN DE SNEPSCHEVT, J. L. A et al.Science of computer programming. 1989, Vol 12, Num 2, pp 151-155, issn 0167-6423Article

Un algorithme efficace de fermeture transitive et un résultat de complexité linéaire dans le pire des cas pour les graphes peu denses = An efficient algorithm of transitive closure and a linear complexity result in the worst case for low density graphsJAUMARD, B; MINOUX, M.1984, 24 p.Report

Abstract derivation of transitive closure algorithmsFEIJS, L. M. G; VAN OMMERING, R. C.Information processing letters. 1997, Vol 63, Num 3, pp 159-164, issn 0020-0190Article

Extensibilité et performance d'un gérant d'objets pour applications Bases de Données = Extensibility and performance of an object manager supporting database applicationsPucheral, Philippe; Gardarin, Georges.1989, 224 p.Thesis

COMPUTATIONAL EXPERIENCES WITH SOME TRANSITIVE CLOSURE ALGORITHMS.SYSLO MM; DZIKIEWICZ J.1975; COMPUTING; AUSTR.; DA. 1975; VOL. 15; NO 1; PP. 33-39; ABS. ALLEM.; BIBL. 18 REF.Article

Génération, Maintien et Parallélisation de la Fermeture Transitive dans un SGBD Déductif = Generation, Maintenance and Paralleligation of the Transitive Closure in a Deductive DBMSHuang, Yan-Nong.1991, 179 p.Thesis

General transitive closure of relations containing duplicatesEDER, J.Information systems (Oxford). 1990, Vol 15, Num 3, pp 335-347, issn 0306-4379, 13 p.Article

A REDUCT-AND-CLOSURE ALGORITHM FOR GRAPHSGORALCIKOVA A; KOUBEK V.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 301-307; BIBL. 7 REF.Conference Paper

Reasoning about iteration in Gödel's class theoryGIJSBERTUS, Johan; BELINFANTE, Frederik.Lecture notes in computer science. 2003, pp 228-242, issn 0302-9743, isbn 3-540-40559-3, 15 p.Conference Paper

Extending fuzzy relationsGONZALEZ, L; MARIN, A.Fuzzy sets and systems. 1995, Vol 69, Num 2, pp 157-169, issn 0165-0114Article

Approximation des relations floues par des quasi-séries inversibles flouesMAKEEV, S. P.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1989, Num 3, pp 37-41, issn 0002-3388Article

Combinatorial properties of dependence graphsEHRENFEUCHT, A; HOOGEBOOM, H. J; ROZENBERG, G et al.Information and computation (Print). 1994, Vol 114, Num 2, pp 315-328, issn 0890-5401Article

T-eigen fuzzy setsFERNANDEZ, M. J; SUAREZ, F; GIL, P et al.Information sciences. 1993, Vol 75, Num 1-2, pp 63-80, issn 0020-0255Article

Cycle-free partial orders and chordal comparability graphsTZE-HENG MA; SPINRAD, J. P.Order (Dordrecht). 1991, Vol 8, Num 1, pp 49-61, issn 0167-8094Article

Computing a transitive opening of a reflexive and symmetric fuzzy relationGARMENDIA, Luis; SALVADOR, Adela.Lecture notes in computer science. 2005, pp 587-599, issn 0302-9743, isbn 3-540-27326-3, 13 p.Conference Paper

Normalizable Horn clauses, strongly recognizable relations, and SpiNIELSON, Flemming; NIELSON, Hanne Riis; SEIDL, Helmut et al.Lecture notes in computer science. 2002, pp 20-35, issn 0302-9743, isbn 3-540-44235-9, 16 p.Conference Paper

Regular model checking made simple and efficientPAROSH AZIZ ABDULLA; JONSSON, Bengt; NILSSON, Marcus et al.Lecture notes in computer science. 2002, pp 116-130, issn 0302-9743, isbn 3-540-44043-7, 15 p.Conference Paper

Transitive signature schemesMICALI, Silvio; RIVEST, Ronald L.Lecture notes in computer science. 2002, pp 236-243, issn 0302-9743, isbn 3-540-43224-8Conference Paper

Confluence of untyped lambda calculus via simple typesGHILEZAN, Silvia; KUNCAK, Viktor.Lecture notes in computer science. 2001, pp 38-49, issn 0302-9743, isbn 3-540-42672-8Conference Paper

Minimizing redundant dependencies and interprocessor synchronizationsHENG-YI CHAO; HARPER, M. P.International journal of parallel programming. 1995, Vol 23, Num 3, pp 245-262, issn 0885-7458Article