Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Thomas, H.: Introduction to Algorithms. MIT Press, Cambridge (2009)
Erdös, P., Rényi, A.: On random graphs I. Publicationes Mathematicae 6, 290–297 (1959)
Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)
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 2012
Trejo-Sánchez, J.A., Fernández-Zepeda, J.A.: Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs. J. Parallel Distrib. Comput. 74(3), 2193–2202 (2014)
Flores-Lamas, A., Fernández-Zepeda, J.A., Trejo-Sánchez, J.A.: Algorithm to find a maximum 2-packing set in a cactus. Theor. Comput. Sci. 725, 31–51 (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Trejo-Sánchez, J.A. et al. (2019). Fast Random Cactus Graph Generation. In: Torres, M., Klapp, J., Gitler, I., Tchernykh, A. (eds) Supercomputing. ISUM 2018. Communications in Computer and Information Science, vol 948. Springer, Cham. https://doi.org/10.1007/978-3-030-10448-1_12
Download citation
DOI: https://doi.org/10.1007/978-3-030-10448-1_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-10447-4
Online ISBN: 978-3-030-10448-1
eBook Packages: Computer ScienceComputer Science (R0)