Abstract
In this paper, an implicit data structure is presented which makes it possible to represent a tree-structured partial order in such a way to efficiently perform operations of path testing and searching among elements of the ground set of the poset. The data structure makes it possible to represent the order relation by referring only to internal nodes of the tree and by associating to each element of the ground set a pair of integer values derived from specific linear extensions of the partial order.
CR Classification
draft paper.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
5. References
H. Alt,K. Melhorn,J.I. Munro "Partial match retrieval in implicit data structures" Inf. Proc; Lett., 19, 2, (1984).
M.D. Atkinson,J.R. Sack,N. Santoro,T. Strohotte "Min-Max heaps and generalized priority queues" Comm.A.C.M., 29,10, (1986).
A.Borodin,F.E.Fich,F.Meyer auf der Heide,E.Upfal, A.Widgerson "A tradeoff between search and update time for the implicit dictionary problem" Proc. 13th ICALP Conf., Lect. Not. in Comp. Sci., 226, Springer Verlag, (1986).
G.N. Frederickson "Implicit data structures for the dictionary problem" J. Ass. Comp. Mach., 30,1, (1983).
G.Gambosi,E.Nardelli,M.Talamo "A pointer-free data structure for merging heaps and min-max heaps" Proc.16th ICALP Conf., Lect. Not. in Comp. Sci., 372, Springer Verlag, (1989).
J.I. Munro "An implicit data structure supporting insertion, deletion and search in O(log2n) time" J. Comp. Syst. Sci., 33, 1, (1986).
J.I. Munro, H. Suwanda "Implicit data structures for fast search and update" J. Comp. Syst. Sci., 21, 2, (1980).
J.R.Sack, T.Strothotte "An algorithm for merging heaps" Act. Inf., 22, (1985).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gambosi, G., Protasi, M., Talamo, M. (1989). An efficient implicit data structure for path testing and searching in rooted trees and forests. In: Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1989. Lecture Notes in Computer Science, vol 405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52048-1_48
Download citation
DOI: https://doi.org/10.1007/3-540-52048-1_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52048-1
Online ISBN: 978-3-540-46872-1
eBook Packages: Springer Book Archive