# An efficient implicit data structure for relation testing and searching in partially ordered sets

- 99 Downloads
- 2 Citations

## Abstract

In this paper, we introduce an implicit data structure which represents a forest-structured partial order to efficiently perform, with respect to time and space, the following operations: 1) testing the relation among two elements (checking whether the two elements are related) and 2) given an element*u*, searching for its father. The first operation can be performed in constant time, while the second one requires polylog time (logarithmic in the case of bounded degree). The data structure represents the order relation by referring only to internal nodes of the forest, thus achieving in many cases a significant saving in space occupation. Finally, the algorithm is shown to be optimal in a restricted computation model by deriving a lower bound on the space complexity within such a model.

## Subject Classification

CR F.2 F.2.2## Keywords

implicit data structures analysis of algorithms complexity lower bounds computation models partially ordered sets## Preview

Unable to display preview. Download preview PDF.

## References

- 1.H. Alt, K. Mehlhorn and J. I. Munro,
*Partial match retrieval in implicit data structures*, Inf. Proc. Lett., 19, 1984, pp. 61–66.Google Scholar - 2.M. D. Atkinson, J. R. Sack, N. Santoro and T. Strothotte,
*Min-max heaps and generalized priority queues*, Comm. A.C.M., 29, 1986, pp. 996–1000.Google Scholar - 3.A. Borodin, F. E. Fich, F. Meyer auf der Heide, E. Upfal and A. Wigderson,
*A tradeoff between search and update time for the implicit dictionary problem*, Theoret. Comp. Sci., 58, 1988, pp. 57–68.Google Scholar - 4.B. Dushnik and E. Miller,
*Partially ordered sets*, Amer. J. Math., 63, 1941, pp. 600–610.Google Scholar - 5.G. N. Frederickson,
*Implicit data structures for the dictionary problem*, J. Ass. Comp. Mach., 30, 1983, pp. 80–94.Google Scholar - 6.G. Gambosi, E. Nardelli and M. Talamo,
*A pointer-free data structure for merging heaps and min-max heaps*, Theoret. Comp. Sci., 84, 1991, pp. 107–126.Google Scholar - 7.G. Gambosi, J. Nešetril and M. Talamo,
*Posets, boolean representation and quick path searching*, Proc. 14th ICALP Conf., Lect. Not. in Comp. Sci., 267, Springer Verlag, 1987, pp. 404–424.Google Scholar - 8.G. Gambosi, J. Nešetril and M. Talamo,
*On locally presented posets*, Theoret. Comp. Sci., 70, 1990, pp. 251–260.Google Scholar - 9.G. Jacobson,
*Space-efficient static trees and graphs*, Proc. 30th Symp. on Found. of Comp. Sci., 1989, pp. 549–554.Google Scholar - 10.S. Kannan, M. Naor and S. Rudich,
*Implicit representation of graphs*, Proc. 20th Symp. on Theory of Computing, 1988, pp. 334–343.Google Scholar - 11.F. Meyer auf der Heide,
*On genuinely time bounded computations*, Proc. 6th STACS, Lect. Not. in Comp. Sci., 349, Springer-Verlag, 1989, pp. 1–16.Google Scholar - 12.J. I. Munro,
*An implicit data structure supporting insertion, deletion and search in O*(log^{2}*n*)*time*, J. Comp. Syst. Sci., 33, 1986, pp. 66–74.Google Scholar - 13.J. I. Munro and H. Suwanda,
*Implicit data structures for fast search and update*, J. Comp. Syst. Sci., 21, 1980, pp. 236–250.Google Scholar - 14.J. R. Sack and T. Strothotte,
*An algorithm for merging heaps*, Acta Inf., 22, 1985, pp. 171–186.Google Scholar