Structuring labeled trees for optimal succinctness, and beyond

@article{Ferragina2005StructuringLT,
  title={Structuring labeled trees for optimal succinctness, and beyond},
  author={Paolo Ferragina and Fabrizio Luccio and Giovanni Manzini and S. Muthukrishnan},
  journal={46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)},
  year={2005},
  pages={184-193}
}
Consider an ordered, static tree /spl Tscr/ on t nodes where each node has a label from alphabet set /spl Sigma/. Tree /spl Tscr/ may be of arbitrary degree and of arbitrary shape. Say, we wish to support basic navigational operations such as find the parent of node u, the ith child of u, and any child of it with label /spl alpha/. In a seminal work over fifteen years ago, Jacobson (1989) observed that pointer-based tree representations are wasteful in space and introduced the notion of… CONTINUE READING
Highly Influential
This paper has highly influenced 13 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 135 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 66 extracted citations

Fast Computation of Subpath Kernel for Trees

View 4 Excerpts
Method Support
Highly Influenced

135 Citations

01020'07'10'13'16'19
Citations per Year
Semantic Scholar estimates that this publication has 135 citations based on the available data.

See our FAQ for additional information.