Craig Lennon

Suggest Changes
Learn More
The Prüfer code is a bijection between trees on the vertex set [n] and strings on the set [n] of length n − 2 (Prüfer strings of order n). In this paper we examine the ‘locality’ properties of the(More)
  • 1