Discrete Applied MathematicsVolume 87, Issues 1–3, 5 October 1998, Pages 275-277NoteThe cyclic wirelength of treesAuthor links open overlay panelS.L. Bezrukov a, U.-P. Schroeder aShow moreShareCitehttps://doi.org/10.1016/S0166-218X(98)00106-1Get rights and contentUnder an Elsevier user licenseopen archiveAbstractWe consider the problem of embedding trees into cyclic host graphs in such a way as to minimize the wirelength. We show that the cyclic wirelength of trees equals their linear wirelength.Previous article in issueNext article in issueKeywordsWirelengthTreesCyclesPathsRecommended articlesCited by (0)Copyright © 1998 Published by Elsevier B.V.