{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T01:36:55Z","timestamp":1782783415889,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T00:00:00Z","timestamp":1720915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100015894","name":"Australian Research Council Centre of Excellence for Mathematical and Statistical Frontiers","doi-asserted-by":"publisher","award":["DP190103894"],"award-info":[{"award-number":["DP190103894"]}],"id":[{"id":"10.13039\/501100015894","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100015894","name":"Australian Research Council Centre of Excellence for Mathematical and Statistical Frontiers","doi-asserted-by":"publisher","award":["FT200100536"],"award-info":[{"award-number":["FT200100536"]}],"id":[{"id":"10.13039\/501100015894","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,14]]},"DOI":"10.1145\/3638529.3654184","type":"proceedings-article","created":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T16:33:04Z","timestamp":1720456384000},"page":"1237-1245","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Evolutionary Diversity Optimisation for Sparse Directed Communication Networks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-9789-7016","authenticated-orcid":false,"given":"Sharlotte","family":"Gounder","sequence":"first","affiliation":[{"name":"The University of Adelaide, Adelaide, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2721-3618","authenticated-orcid":false,"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"The University of Adelaide, Adelaide, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0036-4782","authenticated-orcid":false,"given":"Aneta","family":"Neumann","sequence":"additional","affiliation":[{"name":"The University of Adelaide, Adelaide, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,7,14]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"ICPRAM (1)","author":"Abu-Aisheh Zeina","unstructured":"Zeina Abu-Aisheh, Romain Raveaux, Jean-Yves Ramel, and Patrick Martineau. 2015. An Exact Graph Edit Distance Algorithm for Solving Pattern Recognition Problems. In ICPRAM (1). SciTePress, 271--278."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.130923"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459363"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3077593"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/MILCIS.2018.8574116"},{"key":"e_1_3_2_1_6_1","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","unstructured":"Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms, Third Edition (3rd ed.). The MIT Press.","edition":"3"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3389844"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528724"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/617"},{"key":"e_1_3_2_1_10_1","volume-title":"Smith","author":"Eiben A. E.","year":"2003","unstructured":"A. E. Eiben and James E. Smith. 2003. Introduction to Evolutionary Computing. Springer. 1--300 pages."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528729"},{"key":"e_1_3_2_1_12_1","volume-title":"Data structures and algorithms","author":"Hopcroft John E","unstructured":"John E Hopcroft, Jeffrey D Ullman, and Alfred Vaino Aho. 1983. Data structures and algorithms. Vol. 175. Addison-Wesley Boston, MA, USA:."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815782.2815792"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2021.3098011"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1068-9_10"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.ADHOC.2022.102788"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528755"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459385"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205532"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321796"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583131.3590405"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-04224-0_39"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3450218.3477310"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459384"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528862"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528752"},{"key":"e_1_3_2_1_27_1","volume-title":"Introduction to probability models","author":"Ross Sheldon M","unstructured":"Sheldon M Ross. 2014. Introduction to probability models. Academic Press."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.3390\/S23010206"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/MILCIS49828.2020.9282374"},{"key":"e_1_3_2_1_30_1","volume-title":"Hunjet","author":"Sims Brendan","year":"2019","unstructured":"Brendan Sims, Mohammad Zamani, and Robert A. Hunjet. 2019. Distributed Connectivity Control in Low Probability of Detection Operations. In ASCC. IEEE, 1155--1160. https:\/\/ieeexplore.ieee.org\/document\/8764931"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/S11277-020-07395-Y"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2548471"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.001.1900057"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2021.109775"}],"event":{"name":"GECCO '24: Genetic and Evolutionary Computation Conference","location":"Melbourne VIC Australia","acronym":"GECCO '24","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638529.3654184","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638529.3654184","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:56:54Z","timestamp":1750291014000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638529.3654184"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,14]]},"references-count":34,"alternative-id":["10.1145\/3638529.3654184","10.1145\/3638529"],"URL":"https:\/\/doi.org\/10.1145\/3638529.3654184","relation":{},"subject":[],"published":{"date-parts":[[2024,7,14]]},"assertion":[{"value":"2024-07-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}