All-to-all routing and coloring in weighted trees of rings

Abstract

Article All-to-all routing and coloring in weighted trees of rings Share on Authors: Bruno Beauquier SLOOP 13S-CNRS/INRLA/Universitè de Nice-Sophia Antipolis, 2004 Route des Lucioles, BP 93, F-06902 Sophia Antipolis Cedex, France SLOOP 13S-CNRS/INRLA/Universitè de Nice-Sophia Antipolis, 2004 Route des Lucioles, BP 93, F-06902 Sophia Antipolis Cedex, FranceView Profile , Stéphane Pérennes SLOOP 13S-CNRS/INRLA/Universitè de Nice-Sophia Antipolis, 2004 Route des Lucioles, BP 93, F-06902 Sophia Antipolis Cedex, France SLOOP 13S-CNRS/INRLA/Universitè de Nice-Sophia Antipolis, 2004 Route des Lucioles, BP 93, F-06902 Sophia Antipolis Cedex, FranceView Profile , David Tóth Technical University of Budapest Technical University of BudapestView Profile Authors Info & Claims SPAA '99: Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architecturesJune 1999 Pages 185–190https://doi.org/10.1145/305619.305639Published:01 June 1999 13citation272DownloadsMetricsTotal Citations13Total Downloads272Last 12 Months2Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access