Title

Three Partition Refinement Algorithms

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.

Department(s)

Mathematics and Statistics

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 1987 Society for Industrial and Applied Mathematics (SIAM), All rights reserved.


Share

 
COinS