Wang, C.-X., Yang, Y., & Xu, S.-J. (2025). The algorithm and complexity of co-secure domination in geometric intersection graphs. Computational and Applied Mathematics, 44(1). https://doi.org/10.1007/s40314-024-02982-2
ISO-690 (author-date, English)WANG, Cai-Xia, YANG, Yu und XU, Shou-Jun, 2025. The algorithm and complexity of co-secure domination in geometric intersection graphs. Computational and Applied Mathematics. 1 Februar 2025. Vol. 44, no. 1, . DOI 10.1007/s40314-024-02982-2.
Modern Language Association 9th editionWang, C.-X., Y. Yang, und S.-J. Xu. „The Algorithm and Complexity of Co-Secure Domination in Geometric Intersection Graphs“. Computational and Applied Mathematics, Bd. 44, Nr. 1, Februar 2025, https://doi.org/10.1007/s40314-024-02982-2.
Mohr Siebeck - Recht (Deutsch - Österreich)Wang, Cai-Xia/Yang, Yu/Xu, Shou-Jun: The algorithm and complexity of co-secure domination in geometric intersection graphs, Computational and Applied Mathematics 2025,
Emerald - HarvardWang, C.-X., Yang, Y. und Xu, S.-J. (2025), „The algorithm and complexity of co-secure domination in geometric intersection graphs“, Computational and Applied Mathematics, Vol. 44 No. 1, verfügbar unter:https://doi.org/10.1007/s40314-024-02982-2.