An improved equivalence algorithm

@article{Galler1964AnIE,
  title={An improved equivalence algorithm},
  author={B. Galler and M. Fischer},
  journal={Commun. ACM},
  year={1964},
  volume={7},
  pages={301-303}
}
An algorithm for assigning storage on the basis of EQUIVALENCE, DIMENSION and COMMON declarations is presented. The algorithm is based on a tree structure, and has reduced computation time by 40 percent over a previously published algorithm by identifying all equivalence classes with one scan of the EQUIVALENCE declarations. The method is applicable in any problem in which it is necessary to identify equivalence classes, given the element pairs defining the equivalence relation. 
241 Citations
Set Merging Algorithms
  • 165
  • PDF
On the Expected Performance of Path Compression Algorithms
  • A. Yao
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1985
  • 14
Reference machines require non-linear time to maintain disjoint sets
  • 36
  • PDF
Data structures and algorithms for disjoint set union problems
  • 162
  • PDF
A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets
  • R. Tarjan
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1979
  • 277
The Recognition of Union Trees
  • L. Cai
  • Mathematics, Computer Science
  • Inf. Process. Lett.
  • 1993
  • 6
Backtracking
  • PDF
...
1
2
3
4
5
...