@article{veanes1996construction,
author = {Veanes, Margus and Barklund, Jonas},
title = {Construction of natural cycletrees},
year = {1996},
month = {January},
abstract = {In this article, the following question is answered: Given a cycle C, of size N, how can one compute, in O(N) time, a minimal set of edges E such that adjoining E to the cycle yields a graph with a binary spanning tree having minimal total path length? The answer is given through an algorithm for top-down construction of natural cycletrees, where the structure of each subtree is restricted by a split relation between certain properties of the subtree.},
publisher = {Elsevier},
url = {http://approjects.co.za/?big=en-us/research/publication/construction-of-natural-cycletrees/},
pages = {313-318},
journal = {Information Processing Letters},
volume = {60},
edition = {Information Processing Letters},
}