We 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. (C) 1998 Elsevier Science B.V. All rights reserved. [References: 3]
展开▼
