Three Partition Refinement Algorithms

We present improved partition refinement algorithms for thee problems: Lexicographic sorting, relational coarsest partition, and double lexical ordering. The theme of this paper is partition refinement as an algorithmic paradigm. We consider three problems that can be solved efficiently using a repeated partition refinement strategy.