Finding Antimagic Labelings of Trees by Evolutionary Search

DOI10.1145/3594805.3607133OpenAlexW4385438220MaRDI QIDQ6202150

Unnamed Author, Luke Branson, Andrew M. Sutton

Publication date: 23 February 2024

Published in: Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3594805.3607133

zbMATH Keywords

combinatorial optimizationgraph labelingruntime analysis

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A review of metrics on permutations for search landscape analysis
• The complexity of finding minimum-length generator sequences
• A study of drift analysis for estimating computation time of evolutionary algorithms
• The analysis of evolutionary algorithms on sorting and shortest paths problems
• Antimagicness of generalized corona and snowflake graphs
• Caterpillars are antimagic
• The SAT+CAS method for combinatorial search with applications to best matrices
• Dense graphs are antimagic
• Antimagic Labeling of Regular Graphs
• Constant Time Generation of Free Trees
• Magic and Antimagic Graphs

This page was built for publication: Finding Antimagic Labelings of Trees by Evolutionary Search