Efficient parallel algorithms for finding biconnected components of some intersection graphs
Y. Daniel Liang, Sudarshan Dhall, S. Lakshmivarahan · 1991
Article Efficient parallel algorithms for finding biconnected components of some intersection graphs Share on Authors: Y. Liang Parallel Processing Institute, School of Electrical Engineering and Computer Science, University of Oklahoma, Norman, Oklahoma Parallel Processing Institute, School of Electrical Engineering and Computer Science, University of Oklahoma, Norman, OklahomaView Profile , S. K. Dhall Parallel Processing Institute, School of Electrical Engineering and Computer Science, University of Oklahoma, Norman, Oklahoma Parallel Processing Institute, School of Electrical Engineering and Computer Science, University of Oklahoma, Norman, OklahomaView Profile , S. Lakshmivarahan Parallel Processing Institute, School of Electrical Engineering and Computer Science, University of Oklahoma, Norman, Oklahoma Parallel Processing Institute, School of Electrical Engineering and Computer Science, University of Oklahoma, Norman, OklahomaView Profile Authors Info & Claims CSC '91: Proceedings of the 19th annual conference on Computer ScienceApril 1991 Pages 48–52https://doi.org/10.1145/327164.327204Published:01 April 1991 2citation263DownloadsMetricsTotal Citations2Total Downloads263Last 12 Months2Last 6 weeks0 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