{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:12Z","timestamp":1750219812961,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,31]],"date-time":"2017-07-31T00:00:00Z","timestamp":1501459200000},"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":[[2017,7,31]]},"DOI":"10.1145\/3110025.3116197","type":"proceedings-article","created":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T14:40:22Z","timestamp":1510670422000},"page":"577-584","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["An Evolutionary Framework for Analyzing the Distance Preserving Property of Weighted Graphs"],"prefix":"10.1145","author":[{"given":"Emad","family":"Zahedi","sequence":"first","affiliation":[{"name":"Department of Mathematics, Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, U.S.A."}]},{"given":"Masoud","family":"Mirmomeni","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, U.S.A."}]},{"given":"Abdol-Hossein","family":"Esfahanian","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, U.S.A."}]}],"member":"320","published-online":{"date-parts":[[2017,7,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780195099713.001.0001"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(86)90043-2"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.2307\/1998567"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"issue":"5","key":"e_1_3_2_1_5_1","first-page":"550","article-title":"Graph-based evolutionary algorithms. Evolutionary Computation","volume":"10","author":"Bryden K. M.","year":"2006","unstructured":"K. M. Bryden, D. A. Ashlock, S. Corns, and S. J. Willson. Graph-based evolutionary algorithms. Evolutionary Computation, IEEE Transactions on, 10(5):550--567, 2006.","journal-title":"IEEE Transactions on"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00234-6"},{"issue":"2","key":"e_1_3_2_1_8_1","first-page":"182","article-title":"A fast and elitist multiobjective genetic algorithm: Nsga-ii. Evolutionary Computation","volume":"6","author":"Deb K.","year":"2002","unstructured":"K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan. A fast and elitist multiobjective genetic algorithm: Nsga-ii. Evolutionary Computation, IEEE Transactions on, 6(2): 182--197, 2002.","journal-title":"IEEE Transactions on"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87527-7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1985-0776391-5"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1093\/qmath\/28.4.417"},{"key":"e_1_3_2_1_13_1","volume-title":"Product graphs","author":"Imrich W.","year":"2000","unstructured":"W. Imrich and S. Klavzar. Product graphs. Wiley, 2000."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1361-8415(01)00036-6"},{"key":"e_1_3_2_1_15_1","volume-title":"Distance preserving graphs and graph products. arXiv preprint arXiv: 1507.04800","author":"Khalifeh M.","year":"2015","unstructured":"M. Khalifeh, B. E. Sagan, and E. Zahedi. Distance preserving graphs and graph products. arXiv preprint arXiv: 1507.04800, 2015."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/051\/18"},{"key":"e_1_3_2_1_17_1","volume-title":"Almost all (0, 1) matrices are primitive. springer","author":"Moon J. W.","year":"1965","unstructured":"J. W. Moon and L. Moser. Almost all (0, 1) matrices are primitive. springer, 1965."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579284"},{"key":"e_1_3_2_1_19_1","volume-title":"Congressus Numerantium, 211: 141--149","author":"Nussbaum R.","year":"2012","unstructured":"R. Nussbaum and A.-H. Esfahanian. Preliminary results on distance-preserving graphs. Congressus Numerantium, 211:141--149, 2012."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-1346-2_14"},{"key":"e_1_3_2_1_21_1","volume-title":"On distance preserving and sequentially distance preserving graphs. arXiv preprint arXiv: 1701.06404","author":"Smith J. P.","year":"2017","unstructured":"J. P. Smith and E. Zahedi. On distance preserving and sequentially distance preserving graphs. arXiv preprint arXiv: 1701.06404, 2017."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544861"},{"key":"e_1_3_2_1_24_1","volume-title":"Distance preserving graphs. arXiv preprint arXiv:1507.03615","author":"Zahedi E.","year":"2015","unstructured":"E. Zahedi. Distance preserving graphs. arXiv preprint arXiv:1507.03615, 2015."}],"event":{"name":"ASONAM '17: Advances in Social Networks Analysis and Mining 2017","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","IEEE CS"],"location":"Sydney Australia","acronym":"ASONAM '17"},"container-title":["Proceedings of the 2017 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining 2017"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3110025.3116197","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3110025.3116197","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:09Z","timestamp":1750217409000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3110025.3116197"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,31]]},"references-count":23,"alternative-id":["10.1145\/3110025.3116197","10.1145\/3110025"],"URL":"https:\/\/doi.org\/10.1145\/3110025.3116197","relation":{},"subject":[],"published":{"date-parts":[[2017,7,31]]},"assertion":[{"value":"2017-07-31","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}