An set refinement algorithm with applications

DOI10.1080/00207169108804008MaRDI QIDQ3991118zbMATH OpenOpenAlexFDO

Authors Radhakrishnan Sridhar, N. S. V. Rao, S. S. Iyengar

Publication date 28 June 1992

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169108804008

zbMATH Keywords

inverted listsmultiple attribute treerefinement problemset partition

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Three Partition Refinement Algorithms
• Fast and efficient parallel coarsest refinement
• An efficient algorithm for a special case of the set partition problem
• Partition refinement techniques: an interesting algorithmic tool kit
• A Linear Time Algorithm for Ordered Partition

Cites work

• An average-case analysis of MAT and inverted file
• scientific article; zbMATH DE number 3829300 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Performance evaluation of attribute-based tree organization

Cited in

(2)

• An efficient algorithm for a special case of the set partition problem
• Partition refinement techniques: an interesting algorithmic tool kit

This page was built for publication: An set refinement algorithm with applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3991118)