HSAGA and its application for the construction of near-Moore digraphs

DOI10.1016/j.jda.2007.05.003zbMath1162.05028OpenAlexW1966325212MaRDI QIDQ954960

Jianmin Tang, Mirka Miller, Yu-qing Lin

Publication date: 18 November 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2007.05.003

zbMATH Keywords

digraphsimulated annealingdiametergenetic algorithmMoore bounddegree/diameter problemout-degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Randomized algorithms (68W20)

Related Items (4)

AN EFFICIENT AND PRACTICALLY ROBUST HYBRID METAHEURISTIC ALGORITHM FOR SOLVING FUZZY BUS TERMINAL LOCATION PROBLEMS ⋮ On new record graphs close to bipartite Moore graphs ⋮ Radial Moore graphs of radius three ⋮ Ranking measures for radially Moore graphs

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• On the impossibility of directed Moore graphs
• Moore graphs and beyond: a survey of the degree/diameter problem
• Equation of State Calculations by Fast Computing Machines
• Letter to the Editor—A Monte Carlo Method for the Approximate Solution of Certain Types of Constrained Optimization Problems
• Using simulated annealing to construct extremal graphs

This page was built for publication: HSAGA and its application for the construction of near-Moore digraphs