An O(n2) Self-Stabilizing Algorithm for Minimal Total Dominating Set in Arbitrary Graphs

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: An O(n2) Self-Stabilizing Algorithm for Minimal Total Dominating Set in Arbitrary Graphs
Συγγραφείς: Ding, Yihua, Wang, James Z, srimani, Pradip K
Πηγή: 2020 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT) WI-IAT Web Intelligence and Intelligent Agent Technology (WI-IAT), 2020 IEEE/WIC/ACM International Joint Conference on. :49-54 Dec, 2020
Relation: 2020 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)
Βάση Δεδομένων: IEEE Xplore Digital Library