School of Engineering-Emerging Technologies, University of Tabriz, Tabriz, Iran
Abstract
Optimization problems related to graph-based structures comprise a large proportion of optimization problems appearing in different fields. At present, search algorithms are among the best choices for dealing with such problems. For this purpose, operations which are often needed include successive swapping the vertex labels of a given graph using an appropriate strategy and evaluating the effect of each swap on the quantity under investigation. A major problem for performing the above-mentioned operations is an immense amount of runtime required, especially for large graphs. Obviously, this can present serious problems in the use of search algorithms for addressing real-world problems which usually have complex graph theoretical models and large sizes. In this research, a new structure for organizing and storing data in graphs is proposed with the aim of resolving the problem described above. The results of numerical experiments reveal that the proposed structure is very effective.
)