Analysis of a greedy heuristic for finding small dominating sets in graphs
From MaRDI portal
Publication:1183397
DOI10.1016/0020-0190(91)90021-9zbMath0746.05061MaRDI QIDQ1183397
Publication date: 28 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(91)90021-9
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
On the distribution of the domination number for random class cover catch digraphs, The greedy algorithm for domination in graphs of maximum degree 3, Characterizing the scale dimension of a high-dimensional classification problem, On parallelizing a greedy heuristic for finding small dominant sets
Cites Work