{"id":"https://openalex.org/W4385438220","doi":"https://doi.org/10.1145/3594805.3607133","title":"Finding Antimagic Labelings of Trees by Evolutionary Search","display_name":"Finding Antimagic Labelings of Trees by Evolutionary Search","publication_year":2023,"publication_date":"2023-07-31","ids":{"openalex":"https://openalex.org/W4385438220","doi":"https://doi.org/10.1145/3594805.3607133"},"language":"en","primary_location":{"id":"doi:10.1145/3594805.3607133","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3594805.3607133","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","raw_type":"proceedings-article"},"type":"conference-paper","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/A5067397331","display_name":"Luke Branson","orcid":"https://orcid.org/0009-0009-2781-266X"},"institutions":[{"id":"https://openalex.org/I4210115145","display_name":"University of Minnesota, Duluth","ror":"https://ror.org/01hy4qx27","country_code":"US","type":"education","lineage":["https://openalex.org/I4210115145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Luke Branson","raw_affiliation_strings":["Algorithmic Evolution Lab, Department of Computer Science, University of Minnesota Duluth, Duluth, MN, USA"],"raw_orcid":"https://orcid.org/0009-0009-2781-266X","affiliations":[{"raw_affiliation_string":"Algorithmic Evolution Lab, Department of Computer Science, University of Minnesota Duluth, Duluth, MN, USA","institution_ids":["https://openalex.org/I4210115145"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004695687","display_name":"Andrew M. Sutton","orcid":"https://orcid.org/0000-0003-1295-6715"},"institutions":[{"id":"https://openalex.org/I4210115145","display_name":"University of Minnesota, Duluth","ror":"https://ror.org/01hy4qx27","country_code":"US","type":"education","lineage":["https://openalex.org/I4210115145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew M. Sutton","raw_affiliation_strings":["Algorithmic Evolution Lab, Department of Computer Science, University of Minnesota Duluth, Duluth, MN, USA"],"raw_orcid":"https://orcid.org/0000-0003-1295-6715","affiliations":[{"raw_affiliation_string":"Algorithmic Evolution Lab, Department of Computer Science, University of Minnesota Duluth, Duluth, MN, USA","institution_ids":["https://openalex.org/I4210115145"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050496086","display_name":"Xiankun Yan","orcid":"https://orcid.org/0000-0002-2309-8034"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Xiankun Yan","raw_affiliation_strings":["Optimisation and Logistics Group, School of Computer Science, University of Adelaide, Adelaide, SA, Australia"],"raw_orcid":"https://orcid.org/0000-0002-2309-8034","affiliations":[{"raw_affiliation_string":"Optimisation and Logistics Group, School of Computer Science, University of Adelaide, Adelaide, SA, Australia","institution_ids":["https://openalex.org/I5681781"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"27","last_page":"37"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9998000264167786,"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/bijection","display_name":"Bijection","score":0.8102750778198242},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8014867901802063},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.7115017771720886},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6851931214332581},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5810201168060303},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5175870656967163},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4692065119743347},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.4644726514816284},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4260809123516083},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.398813396692276},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1912611424922943}],"concepts":[{"id":"https://openalex.org/C24424167","wikidata":"https://www.wikidata.org/wiki/Q180907","display_name":"Bijection","level":2,"score":0.8102750778198242},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8014867901802063},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7115017771720886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6851931214332581},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5810201168060303},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5175870656967163},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4692065119743347},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.4644726514816284},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4260809123516083},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.398813396692276},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1912611424922943},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3594805.3607133","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3594805.3607133","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7720089534","display_name":"CAREER: Algorithmic Models of Adaptation","funder_award_id":"2144080","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309636","display_name":"University of Minnesota","ror":"https://ror.org/03grvy078"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1981898306","https://openalex.org/W1994031309","https://openalex.org/W2063643785","https://openalex.org/W2063894623","https://openalex.org/W2148337986","https://openalex.org/W2156622046","https://openalex.org/W2326587081","https://openalex.org/W2592055188","https://openalex.org/W2921963619","https://openalex.org/W2949865692","https://openalex.org/W2972773351","https://openalex.org/W3034371704","https://openalex.org/W3122254133","https://openalex.org/W3131858178","https://openalex.org/W4225881367","https://openalex.org/W4292103565"],"related_works":["https://openalex.org/W2952259524","https://openalex.org/W2279732055","https://openalex.org/W2995857455","https://openalex.org/W4288805235","https://openalex.org/W2027277382","https://openalex.org/W4287020903","https://openalex.org/W1508013399","https://openalex.org/W2998840281","https://openalex.org/W2160566290","https://openalex.org/W2082836330"],"abstract_inverted_index":{"Randomized":[0],"search":[1],"heuristics":[2],"can":[3,21],"sometimes":[4],"be":[5,22],"effective":[6],"verifiers":[7],"for":[8,30,43,77,107],"combinatorial":[9],"conjectures.":[10],"In":[11],"this":[12],"paper,":[13],"we":[14,84],"demonstrate":[15],"how":[16],"a":[17,57,72],"simple":[18,89],"evolutionary":[19,90],"algorithm":[20],"used":[23],"to":[24,34,68,71,94],"confirm":[25],"the":[26,63],"antimagic":[27,55,96],"tree":[28,50],"conjecture":[29],"all":[31,78],"trees":[32,103],"up":[33],"order":[35,106],"25.":[36],"This":[37],"conjecture,":[38],"which":[39],"has":[40,53],"been":[41],"open":[42],"over":[44],"thirty":[45],"years,":[46],"is":[47,75],"that":[48,62,87,88],"every":[49],"except":[51],"K2":[52],"an":[54],"labeling:":[56],"bijective":[58],"edge":[59],"labeling":[60],"such":[61],"sum":[64],"of":[65,104],"labels":[66],"assigned":[67],"edges":[69],"incident":[70],"vertex":[73],"v":[74,80],"unique":[76],"vertices":[79],"\u03f5":[81],"V.":[82],"Moreover,":[83],"formally":[85],"prove":[86],"algorithms":[91],"are":[92],"guaranteed":[93],"find":[95],"labelings":[97],"in":[98],"expected":[99],"polynomial":[100],"time":[101],"on":[102],"any":[105],"certain":[108],"restricted":[109],"classes":[110],"(paths,":[111],"combs,":[112],"uniform":[113,115],"caterpillars,":[114],"spiders":[116],"and":[117],"perfect":[118],"binary":[119],"trees).":[120]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}