Abstract
A number of computational problems can be viewed as instances of the idea of choosing a set of representatives from among a given set of candidates. We derive a general algorithm for computing a set of representatives, and illustrate the solution with two examples. The reasoning is conducted in a point-free style with a calculus of relations.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
