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

Title: HSAGA and its application for the construction of near-Moore digraphs
Creator: Tang, Jianmin; Miller, Mirka; Lin, Yuqing
Date: 2008
Type: Text; Journal article
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/63608
Identifier: vital:871
Identifier: https://doi.org/10.1016/j.jda.2007.05.003
Identifier: ISSN:1570-8667
Abstract: The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree and given diameter. This paper deals with directed graphs. General upper bounds, called Moore bounds, exist for the largest possible order of such digraphs of maximum degree d and given diameter k. It is known that simulated annealing and genetic algorithm are effective techniques to identify global optimal solutions. This paper describes our attempt to build a Hybrid Simulated Annealing and Genetic Algorithm (HSAGA) that can be used to construct large digraphs. We present our new results obtained by HSAGA, as well as several related open problems. © 2007 Elsevier B.V. All rights reserved.; C1
Publisher: Elsevier
Relation: Journal of Discrete Algorithms Vol. 6, no. 1 (2008), p. 73-84
Rights: Copyright Elsevier
Rights: This metadata is freely available under a CCO license
Subject: 0101 Pure Mathematics; Digraphs; Genetic algorithms; Moore bound; Out-degree; Simulated annealing; Optimal systems; Diameter problem; Graph theory
Reviewed

		Thumbnail	File	Description	Size	Format