An efficient search algorithm for partially ordered sets

Abstract

Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has been given, which shows our algorithm can have fewer comparisons than the best known solution by at least a factor of 0.27 under random graph model. Experimental results have also… (More)

Topics

2 Figures and Tables

Slides referencing similar topics