Routing on Trees via Matchings

Roberts, A; Symvonis, A; Zhang, L

dc.contributor.author	Roberts, A	en
dc.contributor.author	Symvonis, A	en
dc.contributor.author	Zhang, L	en
dc.date.accessioned	2014-03-01T02:48:18Z
dc.date.available	2014-03-01T02:48:18Z
dc.date.issued	1995	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33722
dc.subject	Maximum Degree	en
dc.subject	Permutation Routing	en
dc.title	Routing on Trees via Matchings	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/3-540-60220-8_67	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-60220-8_67	en
heal.publicationDate	1995	en
heal.abstract	. In this paper we consider the routing number of trees, denotedby rt(), with respect to the matching routing model. The only known resultis that rt(T ) 3n for an arbitrary tree T of n nodes [2, 3]. By providingoff-line permutation routing algorithms we prove that: i) rt(T ) n + o(n) fora complete d-ary tree T of n nodes,	en
heal.journalName	Workshop on Algorithms and Data Structures	en
dc.identifier.doi	10.1007/3-540-60220-8_67	en