Finding disjoint paths in networks
Deepinder P. Sidhu, Raj Nair, Shukri Abdallah · ACM SIGCOMM Computer Communication Review · 1991
article Finding disjoint paths in networks Share on Authors: Deepinder Sidhu Department of Computer Science, University of Maryland, BC, Baltimore, MD and Institute for Advanced Computer Studies, University of Maryland, CP, College Park, MD Department of Computer Science, University of Maryland, BC, Baltimore, MD and Institute for Advanced Computer Studies, University of Maryland, CP, College Park, MDView Profile , Raj Nair Department of Computer Science, University of Maryland, BC, Baltimore, MD and Institute for Advanced Computer Studies, University of Maryland, CP, College Park, MD Department of Computer Science, University of Maryland, BC, Baltimore, MD and Institute for Advanced Computer Studies, University of Maryland, CP, College Park, MDView Profile , Shukri Abdallah Department of Computer Science, University of Maryland, BC, Baltimore, MD and Institute for Advanced Computer Studies, University of Maryland, CP, College Park, MD Department of Computer Science, University of Maryland, BC, Baltimore, MD and Institute for Advanced Computer Studies, University of Maryland, CP, College Park, MDView Profile Authors Info & Claims ACM SIGCOMM Computer Communication ReviewVolume 21Issue 4Sept. 1991 pp 43–51https://doi.org/10.1145/115994.115998Online:01 August 1991Publication History 111citation2,350DownloadsMetricsTotal Citations111Total Downloads2,350Last 12 Months71Last 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