Distributed Algorithms for Finding the Unique Minimum Distance Dominating Set in Directed Split-stars
Fu-Hsing Wang, Jou-Ming Chang, Yue-Li Wang, and Sun-Jen Huang
Journal of Parallel and Distributed Computing, Vol. 63, No. 4, (2003) pp. 481-487.

The above article has been cited by the articles listed below.
  1. Fu-Hsing Wang, Cheng-Ju Hsu, A distributed algorithm for finding minimal feedback vertex sets in directed split-stars, Proceedings of the 7th International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN-04), Hong Kong, May 2004, pp. 174-179. (*)

  2. Fu-Hsing Wang, Cheng-Ju Hsu, Jen-Chih Tsai, Minimal feedback vertex sets in directed split-stars, Networks 45 (2005) 218-223. (*)

  3. Eddie Cheng, William A. Lindsey, Daniel E. Steffy, Maximal vertex-connectivity of Sn,k, Networks 46 (2005) 154-162.

  4. Kun Liu, Hillol Kargupta, Kanishka Bhaduri, Jessica Ryan, Distributed data mining bibliography, Technique Report, Computer Science and Electrical Engineering Department, University of Maryland Baltimore County, Baltimore, Maryland, March, 2005.

  5. Bo Han, Weijia Jia, Clustering wireless ad hoc networks with weakly connected dominating set, Journal of Parallel and Distributed Computing 67 (2007) 727-737. (*)

  6. Eddie Cheng, László Lipták, Linearly many faults in Cayley graphs generated by transposition trees, Information Sciences 177 (2007) 4877-4882.

  7. Nils Mullner, Simulation of self-stabilizing distributed algorithms to determine fault tolerance measures, Thesis, Faculty II, Department of Computer Science, Group System Software and Distributed Systems, Carl von Ossietzky Universität Oldenburg, 2007.

  8. Doina Bein, Fault-tolerant k-fold pivot routing in wireless sensor networks, Proceedings of the 41st Annual Hawaii International Conference on System Sciences, 7-10 Jan 2008, pp.494.

  9. Fu-Hsing Wang, An efficient distributed algorithm for canonical labeling on directed split-stars, Discrete Applied Mathematics 156 (2008) 3475-3482. (*)

  10. Jian Wan, Daomin Yuan, Xianghua Xu, A review of cluster formation mechanism for clustering routing protocols, Proceedings of 11th IEEE International Conference on Communication Technology (ICCT2008), Hangzhou China, 10-12 Nov. 2008, pp. 611-616.

  11. Doina Bein, Self-configuring, self-organizing, and self-healing schemes in mobile Ad hoc networks, Guide to Wireless Ad Hoc Networks, Chapter 2, Springer London, 2009, pp. 27-41. (*)

  12. Fu-Hsing Wang, A note on leader election in directed split-stars and directed alternating group graphs, International Journal of Computer Mathematics 87 (2010) 2450-2457. (*)

  13. Limei Lin, Li Xu, Shuming Zhou, Conditional diagnosability and strong diagnosability of Split-Star networks under the PMC model, Theoretical Computer Science 562 (2015) 565-580. (*)

  14. Limei Lin, Li Xu, Shuming Zhou, Sun-Yuan Hsieh, The extra, restricted connectivity and conditional diagnosability of split-star networks, IEEE Transactions on Parallel and Distributed Systems 27 (2016) 533-545. (*)

  15. Volker Turau Sven Köhler, A distributed algorithm for minimum distance-k domination in trees, Journal of Graph Algorithms and Applications 19 (2015) 223-242.

  16. Saeed Akhoondian Amiri, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz, Distributed domination on graph classes of bounded expansion, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA 2018), Vienna, Austria, July 16 - 18, 2018, pp.143-151.

  17. Yusupjan Habibulla, Statistical mechanics of the directed 2-distance minimal dominating set problem, Communications in Theoretical Physics 72 (2020) 095602. (*)

  18. Jing Li, Xujing Li, Eddie Cheng, Super spanning connectivity of split-star networks, Information Processing Letters 166 (2021) 106037. (*)

Times cited: 10 (from Web of Science)