Academic Commons Search Results
http://academiccommons.columbia.edu/catalog.rss?f%5Bauthor_facet%5D%5B%5D=Persiano%2C+Giuseppe&f%5Bdepartment_facet%5D%5B%5D=Computer+Science&q=&rows=500&sort=record_creation_date+desc
Academic Commons Search Resultsen-usMinimal Path Length of Trees with Known Fringe
http://academiccommons.columbia.edu/catalog/ac:143762
De Prisco, Roberto; Parlati, Giuseppe; Persiano, Giuseppehttp://hdl.handle.net/10022/AC:P:12368Fri, 27 Jan 2012 00:00:00 +0000In this paper we continue the study of the path length of trees with known fringe as initiated by [1] and [2]. We compute the path length of the minimal tree with given number of leaves N and fringe ∆ for the case ∆ ≥ N/2. This complements the result of [2] that studied the case ∆ ≤ N/2. Our methods also yields a linear time algorithm for constructing the minimal tree when ∆ ≥ N/2.Computer scienceComputer ScienceTechnical reports