Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
Yossi Shiloach, Yehoshua Perl · Journal of the ACM · 1978
article Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph Share on Authors: Y. Shiloach Weizmann Institute of Science, Rehovot, Israel and Computer Science Department, Stanford University, Stanford, CA Weizmann Institute of Science, Rehovot, Israel and Computer Science Department, Stanford University, Stanford, CAView Profile , Y. Perl Department of Mathematics and Computer Science, Bar-Ilan University, Ramat-Gan, Israel Department of Mathematics and Computer Science, Bar-Ilan University, Ramat-Gan, IsraelView Profile Authors Info & Claims Journal of the ACMVolume 25Issue 1Jan. 1978 pp 1–9https://doi.org/10.1145/322047.322048Published:01 January 1978 98citation1,915DownloadsMetricsTotal Citations98Total Downloads1,915Last 12 Months47Last 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 SiteGet Access