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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 973-989 |
| Number of pages | 17 |
| Journal | SIAM Journal on Computing |
| Volume | 16 |
| Issue number | 6 |
| DOIs | |
| State | Published - 1987 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- General Computer Science
- General Mathematics
Fingerprint
Dive into the research topics of 'THREE PARTITION REFINEMENT ALGORITHMS.'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver