Faster shortest-path algorithms for planar graphs

Abstract

Article Free Access Share on Faster shortest-path algorithms for planar graphs Authors: Philip Klein Brown University Brown UniversityView Profile , Satish Rao NEC Research Institute NEC Research InstituteView Profile , Monika Rauch Cornell University Cornell UniversityView Profile , Sairam Subramanian Brown University Brown UniversityView Profile Authors Info & Claims STOC '94: Proceedings of the twenty-sixth annual ACM symposium on Theory of ComputingMay 1994 Pages 27–37https://doi.org/10.1145/195058.195092Published:23 May 1994Publication History 67citation1,842DownloadsMetricsTotal Citations67Total Downloads1,842Last 12 Months44Last 6 weeks6 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