Performance Comparison of Randomized Local Search, (1+1)-Evolutionary Algorithm and Genetic Algorithm for Graph Isomorphism Problem using Permutation Matrix Search Space

Graph isomorphism problem (GIP) is a class NP Problem and is a well-studied problem in graph and complexity theory. It is still an open problem, whether GIP is in class P or NP-complete. In the literature, no meta-heuristics are applied to GIP. However, few studies in the literature show that the me...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Engineering letters 2022-05, Vol.30 (2), p.623
Hauptverfasser:	Puri, Akshitha, Batra, Gunveen, Ajitha, Shenoy K B
Format:	Artikel
Sprache:	eng
Schlagworte:	Complexity theory Evolutionary algorithms Genetic algorithms Graph theory Heuristic methods Isomorphism Markov chains Permutations Searching
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!