Compact Euler Tours of Trees with Small Maximum Degree
share
We show how an Euler tour for a tree on n vertices with maximum degree d can be stored in 2 n + o (n) bits such that queries take O (log n) time and updates take O (d log^1 + ϵ n) time.
READ FULL TEXT