On the public citation graph

Algorithms for the computation of T-transitive closures

0 signed · 71 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-94-011-2014-2_16openalex-snapshot
Cuts Commute with Closures
inferredcites →https://doi.org/10.1007/978-94-015-9540-7openalex-snapshot
Triangular Norms
inferredcites →https://doi.org/10.1007/978-94-017-1648-2openalex-snapshot
Fuzzy Preference Modelling and Multicriteria Decision Support
inferredcites →https://doi.org/10.1016/0165-0114(88)90126-1openalex-snapshot
Special properties, closures and interiors of crisp and fuzzy relations
inferredcites →https://doi.org/10.1016/0165-0114(90)90101-bopenalex-snapshot
Efficient computation of transitive closures
inferredcites →https://doi.org/10.1016/0165-0114(90)90102-copenalex-snapshot
The simplest method of ascending value to find fuzzy transitive closure
inferredcites →https://doi.org/10.1016/0165-0114(92)90191-6openalex-snapshot
An algorithm for computing the transitive closure of a fuzzy similarity matrix
inferredcites →https://doi.org/10.1016/s0020-0190(97)00113-0openalex-snapshot
Abstract derivation of transitive closure algorithms
inferredcites →https://doi.org/10.1016/s0020-0255(02)00407-3openalex-snapshot
On the existence and construction of T-transitive closures
inferredcites →https://doi.org/10.1016/s0020-0255(71)80005-1openalex-snapshot
Similarity relations and fuzzy orderings
inferredcites →https://doi.org/10.1016/s0026-2692(00)00142-7openalex-snapshot
Algorithms sequential and parallel: a unified approach
inferredcites →https://doi.org/10.1016/s0165-0114(83)80006-2openalex-snapshot
Studies in fuzzy relations over fuzzy subsets
inferredcites →https://doi.org/10.1109/tsmc.1974.4309345openalex-snapshot
Fuzzy Chains
inferredcites →https://doi.org/10.1109/tsmc.1974.5409141openalex-snapshot
A Graph Theoretic Analysis of Pattern Classification via Tamura's Fuzzy Relation
inferredcites →https://doi.org/10.5486/pmd.1965.12.1-4.19openalex-snapshot
Representation of associative functions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470724163.ch24openalex-snapshot
Fuzzy Rough Sets: From Theory into Practice
inferred← citeshttps://doi.org/10.1002/9780470974032.ch2openalex-snapshot
Notions and Concepts of Fuzzy Sets: An Introduction
inferred← citeshttps://doi.org/10.1002/9781119534860.ch2openalex-snapshot
Notions and Concepts of Fuzzy Sets
inferred← citeshttps://doi.org/10.1007/0-387-28356-0_15openalex-snapshot
Fuzzy Reasoning
inferred← citeshttps://doi.org/10.1007/11518655_49openalex-snapshot
A New Algorithm to Compute Low T-Transitive Approximation of a Fuzzy Relation Preserving Symmetry. Comparisons with the T-Transitive Closure
inferred← citeshttps://doi.org/10.1007/11518655_50openalex-snapshot
Computing a Transitive Opening of a Reflexive and Symmetric Fuzzy Relation
inferred← citeshttps://doi.org/10.1007/978-1-4419-1153-7_370openalex-snapshot
Fuzzy Sets, Systems, and Applications
inferred← citeshttps://doi.org/10.1007/978-1-4614-6940-7_18openalex-snapshot
Fuzzy Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-030-57977-7_11openalex-snapshot
Symbolic Similarity Relations for Tuning Fully Integrated Fuzzy Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-27774-3_29openalex-snapshot
Comparing Transitive Closure with a New T-transitivization Method
inferred← citeshttps://doi.org/10.1007/978-3-540-74972-1_7openalex-snapshot
Agent-Based Social Modeling and Simulation with Fuzzy Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-02962-2_35openalex-snapshot
Closures of Intuitionistic Fuzzy Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-14049-5_58openalex-snapshot
An Algorithm for Generating Consistent and Transitive Approximations of Reciprocal Preference Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-14880-4_73openalex-snapshot
A Novel Approach Based on Fuzzy Rough Sets for Web Query System
inferred← citeshttps://doi.org/10.1007/978-981-96-9815-8_22openalex-snapshot
Accelerating Possibilistic Model Checking: Sparse Engine for Large-Scale Models
inferred← citeshttps://doi.org/10.1007/s00500-002-0207-5openalex-snapshot
Transitive approximation of fuzzy relations by alternating closures and openings
inferred← citeshttps://doi.org/10.1007/s00500-010-0658-zopenalex-snapshot
Algorithms for computing the optimal transitive approximation of a proximity relation
inferred← citeshttps://doi.org/10.1007/s00607-023-01249-8openalex-snapshot
Community detection of weighted complex networks via transitive closure
inferred← citeshttps://doi.org/10.1007/s10479-011-0852-0openalex-snapshot
Consistent union and prioritized consistent union: new operations for preference aggregation
inferred← citeshttps://doi.org/10.1007/s13370-024-01181-wopenalex-snapshot
A survey on topological structures on fuzzy rough sets
inferred← citeshttps://doi.org/10.1016/j.artint.2008.08.002openalex-snapshot
Label ranking by learning pairwise preferences
inferred← citeshttps://doi.org/10.1016/j.dam.2012.06.013openalex-snapshot
Computing transitive closure of bipolar weighted digraphs
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.11.022openalex-snapshot
Fuzzy relations for the analysis of traders’ preferences in an information market game
inferred← citeshttps://doi.org/10.1016/j.fss.2005.06.005openalex-snapshot
Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
inferred← citeshttps://doi.org/10.1016/j.fss.2009.01.015openalex-snapshot
Computing a T-transitive lower approximation or opening of a proximity relation
inferred← citeshttps://doi.org/10.1016/j.fss.2009.06.016openalex-snapshot
Equivalent bipolar fuzzy relations
inferred← citeshttps://doi.org/10.1016/j.fss.2013.01.014openalex-snapshot
Closing reciprocal relations w.r.t. stochastic transitivity
inferred← citeshttps://doi.org/10.1016/j.ijar.2005.11.001openalex-snapshot
UPGMA clustering revisited: A weight-driven approach to transitive approximation
inferred← citeshttps://doi.org/10.1016/j.ijar.2020.06.002openalex-snapshot
The Fuzzy Logic Programming language FASILL: Design and implementation
inferred← citeshttps://doi.org/10.1016/j.ins.2014.07.029openalex-snapshot
Implementing algorithms of rough set theory and fuzzy rough set theory in the R package “RoughSets”
inferred← citeshttps://doi.org/10.1016/j.jlamp.2024.101020openalex-snapshot
Tuning similarity-based fuzzy logic programs
inferred← citeshttps://doi.org/10.1016/j.knosys.2011.08.013openalex-snapshot
An efficient incremental method for generating equivalence groups of search results in information retrieval and queries
inferred← citeshttps://doi.org/10.1016/j.knosys.2012.02.008openalex-snapshot
Fuzzy relation equations and subsystems of fuzzy transition systems
inferred← citeshttps://doi.org/10.1016/s0020-0255(02)00407-3openalex-snapshot
On the existence and construction of T-transitive closures
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00730-0openalex-snapshot
Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation
inferred← citeshttps://doi.org/10.1016/s0922-3487(08)10003-xopenalex-snapshot
Chapter 3 Partial Ordering and Hasse Diagrams
inferred← citeshttps://doi.org/10.1061/(asce)ey.1943-7897.0000587openalex-snapshot
Fuzzy Equivalence Relation Clustering-Based Algorithm for Coherency Identification among Generators
inferred← citeshttps://doi.org/10.1080/18756891.2013.802117openalex-snapshot
Transitive Closure of Interval-valued Fuzzy Relations
inferred← citeshttps://doi.org/10.1109/fskd.2013.6816241openalex-snapshot
Fuzzy equivalence relation clustering with transitive closure, transitive opening and the optimal transitive approximation
inferred← citeshttps://doi.org/10.1109/fuzz.2002.1006705openalex-snapshot
T-transitive closures, openings and approximations of similarity relations
inferred← citeshttps://doi.org/10.1109/fuzzy.2004.1375710openalex-snapshot
On the min-transitive approximation of symmetric fuzzy relations
inferred← citeshttps://doi.org/10.1109/fuzzy.2010.5584342openalex-snapshot
A threshold for majority in the context of aggregating partial order relations
inferred← citeshttps://doi.org/10.1109/fuzzy.2010.5584671openalex-snapshot
Transitive closure of L-fuzzy relations and interval-valued fuzzy relations
inferred← citeshttps://doi.org/10.1109/grc.2006.1635759openalex-snapshot
The transitive closures of matrices over distributive lattices
inferred← citeshttps://doi.org/10.1109/iske.2008.4731150openalex-snapshot
Transitive closure of interval-valued relations
inferred← citeshttps://doi.org/10.1109/tfuzz.2004.836083openalex-snapshot
A Top-Down Algorithm for Generating the Hasse Tree of a Fuzzy Preorder Closure
inferred← citeshttps://doi.org/10.1109/tfuzz.2006.880004openalex-snapshot
Transitivity Bounds in Additive Fuzzy Preference Structures
inferred← citeshttps://doi.org/10.1109/tfuzz.2006.889762openalex-snapshot
Fuzzy Rough Sets: The Forgotten Step
inferred← citeshttps://doi.org/10.1109/tfuzz.2008.2003128openalex-snapshot
How to Make $T$-Transitive a Proximity Relation
inferred← citeshttps://doi.org/10.1109/tfuzz.2009.2034531openalex-snapshot
A Novel Hierarchical-Clustering-Combination Scheme Based on Fuzzy-Similarity Relations
inferred← citeshttps://doi.org/10.1109/ubmk.2017.8093553openalex-snapshot
Fuzzy assignment models to build the best project team
inferred← citeshttps://doi.org/10.1142/s0218488515500312openalex-snapshot
Clustering Methods Based on Weighted Quasi-Arithmetic Means of T-Transitive Fuzzy Relations
inferred← citeshttps://doi.org/10.1504/ijris.2010.034907openalex-snapshot
Introducing uncertainty into social simulation: using fuzzy logic for agent-based modelling
inferred← citeshttps://doi.org/10.1534/genetics.110.116426openalex-snapshot
Graph-Based Data Selection for the Construction of Genomic Prediction Models
inferred← citeshttps://doi.org/10.3390/axioms14090690openalex-snapshot
Max–Min Transitive Closure of Randomly Generated Fuzzy Matrix: Bernoulli and Classical Probabilistic Models
inferred← citeshttps://doi.org/10.53508/ijiam.1210899openalex-snapshot
Algorithms to Compute The Demonic Transitive Closure of Fuzzy Relations Using Demonic Operators
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.