Routing on Trees

Symvonis, A

dc.contributor.author	Symvonis, A	en
dc.date.accessioned	2014-03-01T01:44:30Z
dc.date.available	2014-03-01T01:44:30Z
dc.date.issued	1996	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/24391
dc.subject	Packet Routing	en
dc.subject	Permutation Routing	en
dc.title	Routing on Trees	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/0020-0190(95)00208-1	en
heal.identifier.secondary	http://dx.doi.org/10.1016/0020-0190(95)00208-1	en
heal.publicationDate	1996	en
heal.abstract	In this paper, we study the permutation packet routing problem on trees. We show that every permutation can be routed on a tree of n vertices in n − 1 routing steps. We provide two algorithms that produce such routing schedules. The first algorithm builds in O(n2) time a schedule that needs O(n2) bits for its description while the second	en
heal.journalName	Information Processing Letters	en
dc.identifier.doi	10.1016/0020-0190(95)00208-1	en