An efficient search algorithm for partially ordered sets

Authors:
Yan Chen
Affiliations:
Department of Computer Science, Fuzhou University, Fuzhou, Fujian, China
Venue:
ACST'06 Proceedings of the 2nd IASTED international conference on Advances in computer science and technology
Year:
2006

Citing 5
Cited 0

Models of random partial orders

Surveys in combinatorics, 1993
Optimal Search in Trees

SIAM Journal on Computing
On tail distribution of interpost distance

Journal of Combinatorial Theory Series B
Discrete Mathematics and Its Applications

Discrete Mathematics and Its Applications
Searching in random partially ordered sets

Theoretical Computer Science - Latin American theorotical informatics

Quantified Score

Hi-index	0.00

Visualization

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 been given, which suggest the advantage of the algorithm under other models.