返回Google圖書搜尋

Routing on Trees Via Matchings

Alan RobertsAntonios SymvonisUniversity of Sydney. Basser Department of Computer ScienceLouxin Zhang

出版	Baser Department of Computer Science, University of Sydney, 1995
URL	http://books.google.com.hk/books?id=hf0UHAAACAAJ&hl=&source=gbs_api

註釋Abstract: "In this paper we consider the routing number of trees, denoted by rt(), with respect to the matching routing model. The only known result is that rt(T) [or =] 3n for an arbitrary tree T of n nodes [2,3]. By providing (recursive) off-line permutation routing algorithms we prove that: 1. rt(T) [