Efficient parallel shortest-paths in digraphs with a separator decomposition
Edith Cohen · 1993
Article Efficient parallel shortest-paths in digraphs with a separator decomposition Share on Author: Edith Cohen View Profile Authors Info & Claims SPAA '93: Proceedings of the fifth annual ACM symposium on Parallel Algorithms and ArchitecturesAugust 1993 Pages 57–67https://doi.org/10.1145/165231.165240Online:01 August 1993Publication History 16citation529DownloadsMetricsTotal Citations16Total Downloads529Last 12 Months4Last 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