Densest k-subgraph
Aviad Rubinstein · 2019
chapter Share on Densest k-subgraph Author: Aviad Rubinstein Stanford University Stanford UniversityView Profile Authors Info & Claims Hardness of Approximation Between P and NPMay 2019 https://doi.org/10.1145/3241304.3241317Published:30 May 2019Publication History 0citation14DownloadsMetricsTotal Citations0Total Downloads14Last 12 Months0Last 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