APA (7th ed.) Citation

Ding, Y., Wang, J. Z., & srimani, P. K. (2020). An O(n2) Self-Stabilizing Algorithm for Minimal Total Dominating Set in Arbitrary Graphs. 2020 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT), Web Intelligence and Intelligent Agent Technology (WI-IAT), 2020 IEEE/WIC/ACM International Joint Conference on, WI-IAT, 49. https://doi.org/10.1109/WIIAT50758.2020.00012

Chicago Style (17th ed.) Citation

Ding, Yihua, James Z. Wang, and Pradip K. srimani. "An O(n2) Self-Stabilizing Algorithm for Minimal Total Dominating Set in Arbitrary Graphs." 2020 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT), Web Intelligence and Intelligent Agent Technology (WI-IAT), 2020 IEEE/WIC/ACM International Joint Conference on, WI-IAT 2020: 49. https://doi.org/10.1109/WIIAT50758.2020.00012.

MLA (9th ed.) Citation

Ding, Yihua, et al. "An O(n2) Self-Stabilizing Algorithm for Minimal Total Dominating Set in Arbitrary Graphs." 2020 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT), Web Intelligence and Intelligent Agent Technology (WI-IAT), 2020 IEEE/WIC/ACM International Joint Conference on, WI-IAT, 2020, p. 49, https://doi.org/10.1109/WIIAT50758.2020.00012.