Fast Random Cactus Graph Generation
In this article, we propose a fast algorithm for generating a cactus graph. Cacti has important applications in diverse areas such as biotechnology, telecommunication systems, sensor networks, among others. Thus, generating good random cacti graphs it is important for simulation of the diverse algorithms and protocols. In this paper, we present an efficient parallel algorithm to generate random cactus. To the best of our knowledge, this algorithm is the first parallel algorithm to generate random cacti graphs.
KeywordsParallel algorithms Graph generation Cacti graphs
- 1.Thomas, H.: Introduction to Algorithms. MIT Press, Cambridge (2009)Google Scholar
- 4.Trejo-Sánchez, J.A., Fernández-Zepeda, J.A.: A self-stabilizing algorithm for the maximal 2-packing in a cactus graph. In: 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), pp. 863–871. IEEE, May 2012Google Scholar