{"id":"https://openalex.org/W2769885767","doi":"https://doi.org/10.1145/3110025.3116197","title":"An Evolutionary Framework for Analyzing the Distance Preserving Property of Weighted Graphs","display_name":"An Evolutionary Framework for Analyzing the Distance Preserving Property of Weighted Graphs","publication_year":2017,"publication_date":"2017-07-31","ids":{"openalex":"https://openalex.org/W2769885767","doi":"https://doi.org/10.1145/3110025.3116197","mag":"2769885767"},"language":"en","primary_location":{"id":"doi:10.1145/3110025.3116197","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3110025.3116197","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007869830","display_name":"Emad Zahedi","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Emad Zahedi","raw_affiliation_strings":["Department of Mathematics, Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, U.S.A"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, U.S.A","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003880095","display_name":"Masoud Mirmomeni","orcid":null},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Masoud Mirmomeni","raw_affiliation_strings":["Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, U.S.A"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, U.S.A","institution_ids":["https://openalex.org/I87216513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015809057","display_name":"Abdol\u2010Hossein Esfahanian","orcid":"https://orcid.org/0000-0001-6018-5471"},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Abdol-Hossein Esfahanian","raw_affiliation_strings":["Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, U.S.A"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, U.S.A","institution_ids":["https://openalex.org/I87216513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5007869830"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.195,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.63624772,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"577","last_page":"584"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9775000214576721,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.957099974155426,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5690330862998962},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5135136246681213},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.5084394812583923},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.4881044328212738},{"id":"https://openalex.org/keywords/isometric-exercise","display_name":"Isometric exercise","score":0.46359366178512573},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4573156535625458},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44617539644241333},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.43949267268180847},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.43328046798706055},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3548525869846344},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.18323224782943726},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.1188911497592926}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5690330862998962},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5135136246681213},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.5084394812583923},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.4881044328212738},{"id":"https://openalex.org/C103486182","wikidata":"https://www.wikidata.org/wiki/Q1216236","display_name":"Isometric exercise","level":2,"score":0.46359366178512573},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4573156535625458},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44617539644241333},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.43949267268180847},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.43328046798706055},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3548525869846344},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.18323224782943726},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.1188911497592926},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C1862650","wikidata":"https://www.wikidata.org/wiki/Q186005","display_name":"Physical therapy","level":1,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3110025.3116197","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3110025.3116197","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W936865023","https://openalex.org/W1484040084","https://openalex.org/W1559956479","https://openalex.org/W1981356557","https://openalex.org/W2007572995","https://openalex.org/W2011490502","https://openalex.org/W2041910029","https://openalex.org/W2064521868","https://openalex.org/W2065017308","https://openalex.org/W2067665576","https://openalex.org/W2076515192","https://openalex.org/W2118382442","https://openalex.org/W2124061247","https://openalex.org/W2126105956","https://openalex.org/W2148726987","https://openalex.org/W2227692056","https://openalex.org/W2395693708","https://openalex.org/W2437720588","https://openalex.org/W2557096638","https://openalex.org/W2578191348","https://openalex.org/W2582271637","https://openalex.org/W4236171716","https://openalex.org/W4242518419","https://openalex.org/W4298044667"],"related_works":["https://openalex.org/W2393701947","https://openalex.org/W167435155","https://openalex.org/W2542507283","https://openalex.org/W2886672068","https://openalex.org/W2953496651","https://openalex.org/W3208942821","https://openalex.org/W2604114816","https://openalex.org/W2811238889","https://openalex.org/W2032950096","https://openalex.org/W231720905"],"abstract_inverted_index":{"A":[0],"subgraph":[1,44],"H":[2,19],"of":[3,16,26,45,53,74,88,165,176],"a":[4,33,80,96,106,127],"given":[5,97],"graph":[6,34,98,211,220],"G":[7,35],"is":[8,36,99,126],"isometric":[9,43,90,115,169,182],"if":[10,39,95],"the":[11,21,24,51,86,119,122,130,139,141,145,147,153,158,163,174,177,207],"distances":[12,25],"between":[13,129],"every":[14,46],"pair":[15],"vertices":[17,28],"in":[18,29,180,232],"are":[20,200,215],"same":[22],"as":[23,67,228],"those":[27],"G.":[30,54],"We":[31],"say":[32],"distance":[37,100,201,209,217],"preserving":[38,56,210],"there":[40],"exists":[41],"an":[42,167],"possible":[47],"order":[48,52],"up":[49],"to":[50,61,84,117],"Distance":[55],"property":[57],"has":[58,221],"been":[59],"applied":[60],"many":[62],"real":[63],"world":[64],"problems":[65],"such":[66],"route":[68],"recommendation":[69],"systems":[70],"and":[71,133,188,224],"all":[72,198],"kinds":[73],"shortest-path-related":[75],"applications.":[76],"Here,":[77],"we":[78,161,205],"propose":[79],"biologically-inspired":[81],"search":[82,148],"algorithm":[83,149,179],"address":[85],"problem":[87],"finding":[89,166,181],"subgraphs":[91,116,183],"that":[92,196],"consequently":[93],"determines":[94],"preserving.":[101,202,218],"In":[102,203],"this":[103,233],"algorithm,":[104],"using":[105],"well":[107],"defined":[108],"fitness":[109],"function,":[110],"selection":[111],"operator":[112],"selects":[113],"almost":[114],"generate":[118],"offspring":[120],"for":[121,185,230],"next":[123],"generation.":[124],"There":[125],"trade-off":[128],"population":[131,142,159],"size":[132,143],"searching":[134],"speed.":[135],"On":[136,152],"one":[137,193],"hand,":[138,155],"larger":[140],"is,":[144],"slower":[146],"would":[150],"be.":[151],"other":[154],"by":[156,190],"increasing":[157],"size,":[160],"increase":[162],"likelihood":[164],"existing":[168],"subgraph.":[170],"Experimental":[171],"results":[172,192],"depict":[173],"performance":[175],"proposed":[178],"even":[184],"challenging":[186],"problems,":[187],"interestingly":[189],"these":[191],"can":[194,225],"see":[195],"\"almost\"":[197],"graphs":[199],"closing,":[204],"show":[206],"smallest":[208],"whose":[212],"product":[213],"factors":[214],"not":[216],"This":[219],"80":[222],"vertices,":[223],"be":[226],"used":[227],"benchmark":[229],"algorithms":[231],"concept.":[234]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}