An Algorithm for Finding a Minimum Equivalent Graph of a Digraph
Dennis M. Moyles, Gerald L. Thompson · Journal of the ACM · 1969
article Free Access Share on An Algorithm for Finding a Minimum Equivalent Graph of a Digraph Authors: Dennis M. Moyles Carnegie-Mellon University, Pittsburgh, Pennsylvania Carnegie-Mellon University, Pittsburgh, PennsylvaniaView Profile , Gerald L. Thompson Carnegie-Mellon University, Pittsburgh, Pennsylvania Carnegie-Mellon University, Pittsburgh, PennsylvaniaView Profile Authors Info & Claims Journal of the ACMVolume 16Issue 301 July 1969pp 455–460https://doi.org/10.1145/321526.321534Published:01 July 1969Publication History 61citation1,053DownloadsMetricsTotal Citations61Total Downloads1,053Last 12 Months101Last 6 weeks12 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