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

Linearization and completeness results for terminating transitive closure queries on spatial databasesGEERTS, Floris; KUIJPERS, Bart; VAN DEN BUSSCHE, Jan et al.SIAM journal on computing (Print). 2006, Vol 35, Num 6, pp 1386-1439, issn 0097-5397, 54 p.Article

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

Mantaining Dynamic Matrices for Fully Dynamic Transitive ClosureDEMETRESCU, Camil; ITALIANO, Giuseppe F.Algorithmica. 2008, Vol 51, Num 4, pp 387-427, issn 0178-4617, 41 p.Article

Improved decremental algorithms for maintaining transitive closure and all-pairs shortest pathsBASWANA, Surender; HARIHARAN, Ramesh; SEN, Sandeep et al.Journal of algorithms (Print). 2007, Vol 62, Num 2, pp 74-92, issn 0196-6774, 19 p.Article

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

Finite-valued indistinguishability operatorsMAYOR, G; RECASENS, J.International journal of approximate reasoning. 2011, Vol 52, Num 7, pp 1018-1033, issn 0888-613X, 16 p.Article

Network analysis using transitive closure : new methods for exploring networksDOUGHERTY, Daniel P; STAHLBERG, Eric A; SADEE, Wolfgang et al.Journal of statistical computation and simulation (Print). 2006, Vol 76, Num 6, pp 539-551, issn 0094-9655, 13 p.Article

On the transitive matrices over distributive latticesTAN, Yi-Jia.Linear algebra and its applications. 2005, Vol 400, pp 169-191, issn 0024-3795, 23 p.Article

Tree canonization and transitive closureETESSAMI, K; IMMERMAN, N.Information and computation (Print). 2000, Vol 157, Num 1-2, pp 2-24, issn 0890-5401Article

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

Transitive Closure of Interval-valued Fuzzy RelationsGONZALEZ-DEL-CAMPO, Ramón; GARMENDIA, Luis; RECASENS, Jordi et al.International journal of computational intelligence systems. 2013, Vol 6, Num 1-6, pp 648-657, 10 p.Article

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

Demi-reconstruction de l'opérateur clôture transitive = Half-reconstruction of the operator transitive closureBOUDABBOUS, Imed; DAMMAK, Jamel.Comptes rendus. Mathématique. 2002, Vol 334, Num 4, pp 257-260, issn 1631-073XArticle

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