{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:06:28Z","timestamp":1750309588944,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T00:00:00Z","timestamp":1729123200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,10,17]]},"DOI":"10.1145\/3723178.3723189","type":"proceedings-article","created":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T07:16:47Z","timestamp":1749194207000},"page":"79-86","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Generating Scale-Free Caterpillar and Series-Parallel Networks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-1274-2396","authenticated-orcid":false,"given":"Mahdee Mushfique","family":"Kamal","sequence":"first","affiliation":[{"name":"Graph Drawing and Information Visualization Laboratory, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), Dhaka, Bangladesh"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-4884-8930","authenticated-orcid":false,"given":"Sujoy","family":"Das","sequence":"additional","affiliation":[{"name":"Graph Drawing and Information Visualization Laboratory, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), Dhaka, Bangladesh"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0112-0242","authenticated-orcid":false,"given":"Md. Saidur","family":"Rahman","sequence":"additional","affiliation":[{"name":"Graph Drawing and Information Visualization Laboratory, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), Dhaka, Bangladesh"}]}],"member":"320","published-online":{"date-parts":[[2025,6,6]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"crossref","unstructured":"Maksudul Alam Kalyan\u00a0S Perumalla and Peter Sanders. 2019. Novel parallel algorithms for fast multi-GPU-based generation of massive scale-free networks. Data Science and Engineering 4 (2019) 61\u201375.","DOI":"10.1007\/s41019-019-0088-6"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"crossref","unstructured":"R\u00e9ka Albert Hawoong Jeong and Albert-L\u00e1szl\u00f3 Barab\u00e1si. 1999. Diameter of the world-wide web. Nature 401 6749 (1999) 130\u2013131.","DOI":"10.1038\/43601"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","unstructured":"Rajeev Alur Caleb Stanford and Christopher Watson. 2023. A Robust Theory of Series Parallel Graphs. Proc. ACM Program. Lang. 7 POPL Article 37 (2023) 31\u00a0pages. 10.1145\/3571230","DOI":"10.1145\/3571230"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"crossref","unstructured":"Raheel Anwar Muhammad\u00a0Irfan Yousuf and Muhammad Abid. 2022. Uniform preferential selection model for generating scale-free networks. Methodology and Computing in Applied Probability 24 1 (2022) 449\u2013470.","DOI":"10.1007\/s11009-021-09854-w"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"publisher","unstructured":"Sof\u00eda Aparicio Javier Villaz\u00f3n-Terrazas and Gonzalo \u00c1lvarez. 2015. A Model for Scale-Free Networks: Application to Twitter. Entropy 17 8 (2015) 5848\u20135867. 10.3390\/e17085848","DOI":"10.3390\/e17085848"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"crossref","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si. 2009. Scale-free networks: a decade and beyond. Science 325 5939 (2009) 412\u2013413.","DOI":"10.1126\/science.1173299"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"crossref","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert. 1999. Emergence of scaling in random networks. Science 286 5439 (1999) 509\u2013512.","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"crossref","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si Erzs\u00e9bet Ravasz and Tamas Vicsek. 2001. Deterministic scale-free networks. Physica A: Statistical Mechanics and its Applications 299 3-4 (2001) 559\u2013564.","DOI":"10.1016\/S0378-4371(01)00369-7"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61680-2_62"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"crossref","unstructured":"Andrei Broder Ravi Kumar Farzin Maghoul Prabhakar Raghavan Sridhar Rajagopalan Raymie Stata Andrew Tomkins and Janet Wiener. 2000. Graph structure in the web. Computer Networks 33 1-6 (2000) 309\u2013320.","DOI":"10.1016\/S1389-1286(00)00083-9"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"publisher","unstructured":"Michele Catanzaro Mari\u00e1n Bogu\u00f1\u00e1 and Romualdo Pastor-Satorras. 2005. Generation of uncorrelated random scale-free networks. Phys. Rev. E 71 (2005) 027103. Issue 2. 10.1103\/PhysRevE.71.027103","DOI":"10.1103\/PhysRevE.71.027103"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"publisher","unstructured":"Yuemin Ding Xiaohui Li Yu-Chu Tian Gerard Ledwich Yateendra Mishra and Chunjie Zhou. 2019. Generating Scale-Free Topology for Wireless Neighborhood Area Networks in Smart Grid. IEEE Transactions on Smart Grid 10 4 (2019) 4245\u20134252. 10.1109\/TSG.2018.2854645","DOI":"10.1109\/TSG.2018.2854645"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"crossref","unstructured":"Sergey\u00a0N Dorogovtsev Alexander\u00a0V Goltsev and Jos\u00e9 Ferreira\u00a0F Mendes. 2002. Pseudofractal scale-free web. Physical Review E 65 6 (2002) 066122.","DOI":"10.1103\/PhysRevE.65.066122"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"publisher","unstructured":"N. Eggemann and S.D. Noble. 2011. The clustering coefficient of a scale-free random graph. Discrete Applied Mathematics 159 10 (2011) 953\u2013965. 10.1016\/j.dam.2011.02.003","DOI":"10.1016\/j.dam.2011.02.003"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"crossref","unstructured":"A Eiger Kris Sikorski and Frank Stenger. 1984. A bisection method for systems of nonlinear equations. ACM Transactions on Mathematical Software (TOMS) 10 4 (1984) 367\u2013377.","DOI":"10.1145\/2701.2705"},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"crossref","unstructured":"Sherif El-Basil. 1987. Applications of caterpillar trees in chemistry and physics. Journal of Mathematical Chemistry 1 2 (1987) 153\u2013174.","DOI":"10.1007\/BF01205666"},{"key":"e_1_3_3_1_18_2","first-page":"273","volume-title":"Advances in the Theory of Benzenoid Hydrocarbons","author":"El-Basil Sherif","year":"1990","unstructured":"Sherif El-Basil. 1990. Caterpillar (Gutman) trees in chemical graph theory. In Advances in the Theory of Benzenoid Hydrocarbons, Ivan Gutman and Sven\u00a0J. Cyvin (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 273\u2013289."},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"publisher","unstructured":"Calvin\u00a0C. Elgot and Jesse\u00a0B. Wright. 1959. Series-parallel graphs and lattices. Duke Mathematical Journal 26 2 (1959) 325 \u2013 338. 10.1215\/S0012-7094-59-02631-6","DOI":"10.1215\/S0012-7094-59-02631-6"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"crossref","unstructured":"Paul Erd\u0151s and Alfr\u00e9d R\u00e9nyi. 1959. On random graph. Publicationes Mathematicate 6 (1959) 290\u2013297.","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"e_1_3_3_1_21_2","unstructured":"Paul Erd\u0151s and Alfr\u00e9d R\u00e9nyi. 1960. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci 5 1 (1960) 17\u201360."},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"publisher","unstructured":"Giorgio Fagiolo. 2007. Clustering in complex directed networks. Phys. Rev. E 76 (08 2007) 026107. Issue 2. 10.1103\/PhysRevE.76.026107","DOI":"10.1103\/PhysRevE.76.026107"},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"crossref","unstructured":"Michalis Faloutsos Petros Faloutsos and Christos Faloutsos. 1999. On power-law relationships of the internet topology. ACM SIGCOMM Computer Communication Review 29 4 (1999) 251\u2013262.","DOI":"10.1145\/316194.316229"},{"key":"e_1_3_3_1_24_2","doi-asserted-by":"crossref","unstructured":"Dario Fasino Arianna Tonetto and Francesco Tudisco. 2021. Generating large scale-free networks with the Chung\u2013Lu random graph model. Networks 78 2 (2021) 174\u2013187.","DOI":"10.1002\/net.22012"},{"key":"e_1_3_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882964"},{"key":"e_1_3_3_1_26_2","doi-asserted-by":"crossref","unstructured":"Paul\u00a0W Holland and Samuel Leinhardt. 1971. Transitivity in structural models of small groups. Comparative group studies 2 2 (1971) 107\u2013124.","DOI":"10.1177\/104649647100200201"},{"key":"e_1_3_3_1_27_2","doi-asserted-by":"crossref","unstructured":"Hawoong Jeong Sean\u00a0P Mason A-L Barab\u00e1si and Zoltan\u00a0N Oltvai. 2001. Lethality and centrality in protein networks. Nature 411 6833 (2001) 41\u201342.","DOI":"10.1038\/35075138"},{"key":"e_1_3_3_1_28_2","doi-asserted-by":"crossref","unstructured":"Hawoong Jeong B\u00e1lint Tombor R\u00e9ka Albert Zoltan\u00a0N Oltvai and A-L Barab\u00e1si. 2000. The large-scale organization of metabolic networks. Nature 407 6804 (2000) 651\u2013654.","DOI":"10.1038\/35036627"},{"key":"e_1_3_3_1_29_2","doi-asserted-by":"publisher","unstructured":"Wenchao Jiang Yinhu Zhai Zhigang Zhuang Paul Martin Zhiming Zhao and Jia-Bao Liu. 2018. An Efficient Method of Generating Deterministic Small-World and Scale-Free Graphs for Simulating Real-World Networks. IEEE Access 6 (2018) 59833\u201359842. 10.1109\/ACCESS.2018.2875928","DOI":"10.1109\/ACCESS.2018.2875928"},{"key":"e_1_3_3_1_30_2","doi-asserted-by":"crossref","unstructured":"S Jung S Kim and B Kahng. 2002. Geometric fractal growth model for scale-free networks. Physical Review E 65 5 (2002) 056101.","DOI":"10.1103\/PhysRevE.65.056101"},{"key":"e_1_3_3_1_31_2","doi-asserted-by":"crossref","unstructured":"J\u00falia Komj\u00e1thy and K\u00e1roly Simon. 2011. Generating hierarchial scale-free graphs from fractals. Chaos Solitons & Fractals 44 8 (2011) 651\u2013666.","DOI":"10.1016\/j.chaos.2011.05.012"},{"key":"e_1_3_3_1_32_2","doi-asserted-by":"publisher","unstructured":"Xiaochen Pi Longkun Tang and Xiangzhong Chen. 2021. A directed weighted scale-free network model with an adaptive evolution mechanism. Physica A: Statistical Mechanics and its Applications 572 (2021) 125897. 10.1016\/j.physa.2021.125897","DOI":"10.1016\/j.physa.2021.125897"},{"key":"e_1_3_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-19-9582-8_14"},{"key":"e_1_3_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49475-32"},{"key":"e_1_3_3_1_35_2","doi-asserted-by":"crossref","unstructured":"Sergei Sidorov Sergei Mironov and Timofei\u00a0D Emelianov. 2023. Scale-free network generation model with addition and deletion of nodes based on triadic closure mechanism. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2312.05543 (2023).","DOI":"10.2139\/ssrn.4843700"},{"key":"e_1_3_3_1_36_2","doi-asserted-by":"publisher","unstructured":"M. Syslo. 1984. Series - parallel graphs and depth-first search trees. IEEE Transactions on Circuits and Systems 31 12 (1984) 1029\u20131033. 10.1109\/TCS.1984.1085460","DOI":"10.1109\/TCS.1984.1085460"},{"key":"e_1_3_3_1_37_2","doi-asserted-by":"crossref","unstructured":"Kazuhiko Takamizawa Takao Nishizeki and Nobuji Saito. 1982. Linear-time computability of combinatorial problems on series-parallel graphs. Journal of the ACM (JACM) 29 3 (1982) 623\u2013641.","DOI":"10.1145\/322326.322328"},{"key":"e_1_3_3_1_38_2","doi-asserted-by":"crossref","unstructured":"Duncan\u00a0J Watts and Steven\u00a0H Strogatz. 1998. Collective dynamics of \u2018small-world\u2019networks. Nature 393 6684 (1998) 440\u2013442.","DOI":"10.1038\/30918"},{"key":"e_1_3_3_1_39_2","doi-asserted-by":"publisher","unstructured":"Chuankui Yan. 2023. Network Model with Scale-Free High Clustering Coefficients and Small-World Properties. Journal of Applied Mathematics 2023 (17 04 2023) 5533260. 10.1155\/2023\/5533260","DOI":"10.1155\/2023\/5533260"},{"key":"e_1_3_3_1_40_2","unstructured":"Andy Yoo and Keith Henderson. 2010. Parallel Generation of Massive Scale-Free Graphs. arxiv:https:\/\/arXiv.org\/abs\/1003.3684\u00a0[cs.DC]"}],"event":{"name":"ICCA 2024: 3rd International Conference on Computing Advancements","acronym":"ICCA 2024","location":"Dhaka Bangladesh"},"container-title":["Proceedings of the 3rd International Conference on Computing Advancements"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3723178.3723189","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3723178.3723189","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:56:46Z","timestamp":1750298206000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3723178.3723189"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,17]]},"references-count":39,"alternative-id":["10.1145\/3723178.3723189","10.1145\/3723178"],"URL":"https:\/\/doi.org\/10.1145\/3723178.3723189","relation":{},"subject":[],"published":{"date-parts":[[2024,10,17]]},"assertion":[{"value":"2025-06-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}