Efficient parallel algorithms for path problems in directed graphs
Joan M. Lucas, M. G. Sackrowit · 1989
Article Free Access Share on Efficient parallel algorithms for path problems in directed graphs Authors: J. M. Lucas Department of Computer Science, Rutgers University, New Brunswick, NJ Department of Computer Science, Rutgers University, New Brunswick, NJView Profile , M. G. Sackrowit Department of Computer Science, Rutgers University, New Brunswick, NJ Department of Computer Science, Rutgers University, New Brunswick, NJView Profile Authors Info & Claims SPAA '89: Proceedings of the first annual ACM symposium on Parallel algorithms and architecturesMarch 1989 Pages 369–377https://doi.org/10.1145/72935.72975Published:01 March 1989Publication History 1citation393DownloadsMetricsTotal Citations1Total Downloads393Last 12 Months3Last 6 weeks1 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 SiteeReaderPDF