Finding long paths and cycles in sparse Hamiltonian graphs
Tomás Feder, Rajeev Motwani, Carlos Subi · 2000
Article Finding long paths and cycles in sparse Hamiltonian graphs Share on Authors: Tomas Feder View Profile , Rajeev Motwani Department of Computer Science, Stanford University, CA Department of Computer Science, Stanford University, CAView Profile , Carlos Subi View Profile Authors Info & Claims STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computingMay 2000 Pages 524–529https://doi.org/10.1145/335305.335368Online:01 May 2000Publication History 9citation694DownloadsMetricsTotal Citations9Total Downloads694Last 12 Months16Last 6 weeks2 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