79 search results - page 1 / 16 » Succinct Ordinal Trees Based on Tree Covering |
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...