On the probe problem for (r,ℓ)-well-coveredness: Algorithms and complexity

Autor:	Faria, Luerbio, Souza, Uéverton S.
Zdroj:	In Theoretical Computer Science 6 October 2022 932:56-68
Databáze:	ScienceDirect
Externí odkaz:	Zobrazit plný text záznamu Full Text from ScienceDirect