Cite
Efficient enumeration of dominating sets for sparse graphs.
MLA
Kurita, Kazuhiro, et al. “Efficient Enumeration of Dominating Sets for Sparse Graphs.” Discrete Applied Mathematics, vol. 303, Nov. 2021, pp. 283–95. EBSCOhost, https://doi.org/10.1016/j.dam.2021.06.004.
APA
Kurita, K., Wasa, K., Arimura, H., & Uno, T. (2021). Efficient enumeration of dominating sets for sparse graphs. Discrete Applied Mathematics, 303, 283–295. https://doi.org/10.1016/j.dam.2021.06.004
Chicago
Kurita, Kazuhiro, Kunihiro Wasa, Hiroki Arimura, and Takeaki Uno. 2021. “Efficient Enumeration of Dominating Sets for Sparse Graphs.” Discrete Applied Mathematics 303 (November): 283–95. doi:10.1016/j.dam.2021.06.004.