Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem
From MaRDI portal
(Redirected from Threshold-based preprocessing for approximating the weighted dense k-subgraph problem)
Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem
Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.
