Scholarly Works

Three Partition Refinement Algorithms

Journal article

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.

Authors

Paige R; Tarjan RE

Journal

SIAM Journal on Computing, Vol. 16, No. 6, pp. 973–989

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Publication Date

December 1, 1987

DOI

10.1137/0216062

ISSN

0097-5397

Associated Experts

Richard Paige

Professor, Faculty of Engineering

Labels

Fields of Research (FoR)

4901 Applied mathematics 46 Information and Computing Sciences 49 Mathematical Sciences 4613 Theory of computation 4903 Numerical and computational mathematics

View published work (Non-McMaster Users)

View published work (McMaster Users)

Contact the Experts team

Get technical help

or

Provide website feedback