Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2768345
Jump to:navigation, search

zbMath0987.68054MaRDI QIDQ2768345

Venkatesh Raman, J. Ian Munro, Adam J. Storm

Publication date: 30 January 2002


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

binary trees


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)


Related Items (12)

Representation of ordered trees with a given degree distribution ⋮ Succinct data structure for dynamic trees with faster queries ⋮ A Uniform Approach Towards Succinct Representation of Trees ⋮ A uniform paradigm to succinctly encode various families of trees ⋮ m-Bonsai: A Practical Compact Dynamic Trie ⋮ Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet ⋮ Succinct representations of planar maps ⋮ Succinct representation of dynamic trees ⋮ Succinct data structures for searchable partial sums with optimal worst-case performance ⋮ Fully Functional Static and Dynamic Succinct Trees ⋮ Succinct Representations of Ordinal Trees ⋮ Succinct dynamic cardinal trees







This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2768345&oldid=15647619"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 14:31.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki