A polynomial-time approximation to a minimum dominating set in a graph
From MaRDI portal
Publication:2166772
DOI10.1016/j.tcs.2022.07.020WikidataQ114129071 ScholiaQ114129071MaRDI QIDQ2166772
Nodari Vakhania, José María Sigarreta-Almira, F. A. Hernández-Mira, Ernesto Parra Inza
Publication date: 25 August 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.04560
68Qxx: Theory of computing