An Optimized Representation for Dynamic k-ary Cardinal Trees

An Optimized Representation for Dynamic k-ary Cardinal Trees

Trees are one of the most fundamental structures in computer science. Standard pointer-based representations consume a significant amount of space while only supporting a small set of navigational operations. Succinct data structures have been developed to overcome these difficulties. A succinct dat...

Full description

Bibliographic Details
Main Author: Yasam, Venkata Sudheer Kumar Reddy
Format: Others
Language:English
Published: Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation 2009
Subjects:
Succinct data structures
binary trees
ordinal trees
cardinal trees
rank
select
static and dynamic.
Computer Sciences
Datavetenskap (datalogi)
Online Access:http://urn.kb.se/resolve?urn=urn:nbn:se:bth-2199

Internet

http://urn.kb.se/resolve?urn=urn:nbn:se:bth-2199

Similar Items