String Trees
A string-like compact data structure for unlabelled rooted trees is given using 2n bits.
cs.DS↗
arXiv subjects
Julius D'souza
Publications and source records attributed to Julius D'souza.
arXiv subjects
Publications and source records attributed to Julius D'souza.
A string-like compact data structure for unlabelled rooted trees is given using 2n bits.