On the all-pairs-shortest-path problem
Raimund Seidel · 1992
Article Free Access Share on On the all-pairs-shortest-path problem Author: Raimund Seidel Computer Science Division, University of California, Berkeley, Berkeley, CA Computer Science Division, University of California, Berkeley, Berkeley, CAView Profile Authors Info & Claims STOC '92: Proceedings of the twenty-fourth annual ACM symposium on Theory of ComputingJuly 1992 Pages 745–749https://doi.org/10.1145/129712.129784Published:01 July 1992Publication History 52citation1,761DownloadsMetricsTotal Citations52Total Downloads1,761Last 12 Months86Last 6 weeks5 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