Cite
Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs.
MLA
Neggazi, Brahim, et al. “Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs.” International Journal of Foundations of Computer Science, vol. 26, no. 6, Sept. 2015, pp. 751–68. EBSCOhost, https://doi.org/10.1142/S0129054115500422.
APA
Neggazi, B., Guellati, N., Haddad, M., & Kheddouci, H. (2015). Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs. International Journal of Foundations of Computer Science, 26(6), 751–768. https://doi.org/10.1142/S0129054115500422
Chicago
Neggazi, Brahim, Nabil Guellati, Mohammed Haddad, and Hamamache Kheddouci. 2015. “Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs.” International Journal of Foundations of Computer Science 26 (6): 751–68. doi:10.1142/S0129054115500422.