Answers are grounded in this paper and cite their sources.
We present improved partition refinement algorithms for three problems: lexicographic sorting, relational coarsest partition, and double lexical ordering. Our double lexical ordering algorithm uses a new, efficient method for unmerging two sorted sets.
No takes yet. Share an insight, caveat, or question.
Paige et al. (1987) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: