Equivalence Relation Representation
Equivalence Relation Representation is a formal framework in discrete mathematics that, as a data structure and algorithmic paradigm, uniquely encodes and dynamically maintains partitions of a set by representing each equivalence class through a canonical element, thereby enabling efficient query and union operations under the constraints of reflexivity, symmetry, and transitivity.
258
Publications
11K
Citations
504
Authors
307
Institutions
Publications per year
2017–2026
39
Parents
258
An improved equivalence algorithm
Bernard A. Galler, Michael Fisher · Communications of the ACM · 1964 · 310 citations · Full text
EQUIVALENCE CLASS ANALYSIS OF GENETIC ALGORITHMS
Nicholas J. Radcliffe · 1991 · 242 citations
1–5 of 258
504
6
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 504
307

Centre National de la Recherche Scientifique
Paris, France
5 h-index
9 publications
379 citations

The Graduate Center, CUNY
New York, United States
4 h-index
9 publications
316 citations

Queens College, CUNY
New York, United States
4 h-index
7 publications
211 citations

College of Staten Island
New York, United States
3 h-index
4 publications
158 citations
National University of Ireland, Maynooth
Maynooth, Ireland
3 h-index
6 publications
170 citations
Université Paris-Sud
Orsay, France
3 h-index
3 publications
63 citations

Akdeniz University
Antalya, Türkiye
3 h-index
3 publications
112 citations

University of Regina
Regina, Canada
3 h-index
6 publications
200 citations
1–8 of 307
11 publications · 351 citations
11
h-index
8 publications · 237 citations
8
h-index
TRAN · 8 publications · 313 citations
8
h-index
6 publications · 79 citations
7
h-index
7 publications · 231 citations
7
h-index
1–5