Exact algorithms for problems related to the densest \(k\)-set problem
From MaRDI portal
Publication:2448865
DOI10.1016/j.ipl.2014.04.009zbMath1302.05182MaRDI QIDQ2448865
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Peter Rossmanith, Guan-Han Wu
Publication date: 5 May 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2014.04.009
design of algorithms; exact algorithm; partial vertex cover; densest (sparsest) \(k\)-set; minimum (maximum) \(k\)-vertex cover
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)