Computational analysis of the random components induced by a binary equivalence relation

Computational analysis of the random components induced by a binary equivalence relation

The problem of partitioning into classes by means of a binary equivalence relation is investigated. Several algorithms for determining the number of components in the graph associated with a particular set of elements are constructed and compared. When the classification process operates on independ...

Full description

Bibliographic Details
Main Author: Balbine, Guy de
Format: Others
Published: 1968
Online Access:https://thesis.library.caltech.edu/4495/1/Balbine_g_1968.pdf
Balbine, Guy de (1968) Computational analysis of the random components induced by a binary equivalence relation. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/2A9K-P464. https://resolver.caltech.edu/CaltechETD:etd-11102005-145557 <https://resolver.caltech.edu/CaltechETD:etd-11102005-145557>

Internet

https://thesis.library.caltech.edu/4495/1/Balbine_g_1968.pdf
Balbine, Guy de (1968) Computational analysis of the random components induced by a binary equivalence relation. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/2A9K-P464. https://resolver.caltech.edu/CaltechETD:etd-11102005-145557 <https://resolver.caltech.edu/CaltechETD:etd-11102005-145557>

Similar Items