The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
Mihalis Yannakakis · Journal of the ACM · 1979
article Free Access Share on The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems Author: Mihalis Yannakakis Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ and Princeton University, Princeton, New Jersey Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ and Princeton University, Princeton, New JerseyView Profile Authors Info & Claims Journal of the ACMVolume 26Issue 4Oct. 1979 pp 618–630https://doi.org/10.1145/322154.322157Published:01 October 1979Publication History 45citation611DownloadsMetricsTotal Citations45Total Downloads611Last 12 Months32Last 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 Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF