Disjoint Sets
Disjoint Sets is a set-theoretic concept referring to a collection of two or more sets that share no common elements, distinguished from other set relations by the absence of intersection between any pair of constituent sets.
693
Publications
35.3K
Citations
1.4K
Authors
634
Institutions
Publications per year
2017–2026
96
Variants
Mutually Exclusive Sets
Parents
693
Maurice Sion · Pacific Journal of Mathematics · 1958 · 1.9K citations · Full text
Efficient algorithms for mining outliers from large data sets
Sridhar Ramaswamy, Rajeev Rastogi, Kyuseok Shim · 2000 · 1.1K citations · Full text
The Economics of Matching: Stability and Incentives
Alvin E. Roth · Mathematics of Operations Research · 1982 · 925 citations
1–5 of 693
1.4K
9
h-index
6
h-index
6
h-index
5
h-index
University at Buffalo, State University of New York, United States
5 publications · 435 citations
5
h-index
1–5 of 1.4K
634

Centre National de la Recherche Scientifique
Paris, France
12 h-index
21 publications
467 citations

Tel Aviv University
Tel Aviv, Israel
11 h-index
14 publications
468 citations
Technion – Israel Institute of Technology
Haifa, Israel
11 h-index
21 publications
783 citations
Princeton University
Princeton, United States
10 h-index
12 publications
973 citations
University of Illinois Urbana-Champaign
Urbana, United States
10 h-index
15 publications
2.4K citations
Stanford University
Stanford, United States
10 h-index
14 publications
735 citations

University of Minnesota
Minneapolis, United States
9 h-index
18 publications
1.6K citations
Purdue University West Lafayette
West Lafayette, United States
8 h-index
13 publications
284 citations
1–8 of 634
20 publications · 2.7K citations
18
h-index
PROC · 20 publications · 536 citations
14
h-index
TRAN · 16 publications · 517 citations
13
h-index
17 publications · 613 citations
13
h-index
Repository · 19 publications · 435 citations
12
h-index
1–5