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

DOI10.1016/J.JDA.2007.05.003zbMATH Open1162.05028OpenAlexW1966325212MaRDI QIDQ954960FDOQ954960

Authors: Jianmin Tang, Mirka Miller, Yuqing 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

Recommendations

• Moore graphs and beyond: a survey of the degree/diameter problem
• scientific article; zbMATH DE number 5994744
• Construction Techniques for Digraphs with Minimum Diameter
• Large vertex symmetric digraphs
• scientific article; zbMATH DE number 4014755

zbMATH Keywords

simulated annealingdiametergenetic algorithmdigraphdegree/diameter problemMoore boundout-degree

Mathematics Subject Classification ID

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

Cites Work

• Optimization by simulated annealing
• Equation of state calculations by fast computing machines
• Moore graphs and beyond: a survey of the degree/diameter problem
• Letter to the Editor—A Monte Carlo Method for the Approximate Solution of Certain Types of Constrained Optimization Problems
• On the impossibility of directed Moore graphs
• Title not available (Why is that?)
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Using simulated annealing to construct extremal graphs

Cited In (4)

• Radial Moore graphs of radius three
• On new record graphs close to bipartite Moore graphs
• An efficient and practically robust hybrid metaheuristic algorithm for solving fuzzy bus terminal location problems
• Ranking measures for radially Moore graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954960)