Abstract
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.
Recommended Citation
R. Paige and R. E. Tarjan, "Three Partition Refinement Algorithms," SIAM Journal on Computing, Society for Industrial and Applied Mathematics (SIAM), Jan 1987.
The definitive version is available at https://doi.org/10.1137/0216062
Department(s)
Mathematics and Statistics
International Standard Serial Number (ISSN)
0097-5397
Document Type
Article - Journal
Document Version
Final Version
File Type
text
Language(s)
English
Rights
© 1987 Society for Industrial and Applied Mathematics (SIAM), All rights reserved.
Publication Date
01 Jan 1987
