Simulated annealing algorithm for detecting graph isomorphism

DOI10.1016/S1004-4132(08)60195-4MaRDI QIDQ3613848zbMATH OpenOpenAlexFDO

Authors

Publication date 12 March 2009

Published in Journal of Systems Engineering and Electronics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s1004-4132(08)60195-4

zbMATH Keywords

graph isomorphism problemlocal searchnondeterministic polynomial problemsimulated annealing algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 4114093
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• An algorithm for optimal isomorphism between two random graphs
• Isomorphism testing via polynomial-time graph extensions
• scientific article; zbMATH DE number 1389083

This page was built for publication: Simulated annealing algorithm for detecting graph isomorphism

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