An algorithm for optimal isomorphism between two random graphs

DOI10.1016/0167-8655(94)90079-5MaRDI QIDQ4301315zbMATH OpenOpenAlexFDO

Authors Dong Su Seong, Young Kyu Choi, Hosung Kim, Kyu Ho Park

Publication date 21 July 1994

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8655(94)90079-5

zbMATH Keywords

entropygraph isomorphismrandom graphsstate-space search problem

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Isomorphisms between random graphs
• Improved random graph isomorphism
• Random Graph Isomorphism
• scientific article; zbMATH DE number 3959485
• A Randomized Parallel Algorithm for Planar Graph Isomorphism
• On an optimal randomized acceptor for graph nonisomorphism
• Algorithms for the graph isomorphism problem based on graph deregularisation
• scientific article; zbMATH DE number 7403940
• Publication:4206773
• Approximate graph isomorphism

Cited in

(5)

• Simulated annealing algorithm for detecting graph isomorphism
• An algorithm for graph optimal monomorphism
• scientific article; zbMATH DE number 841627 (Why is no real title available?)
• An algorithm for determining isomorphism using lexicographic sorting and the matrix inverse
• An optimally data efficient isomorphism inference algorithm

This page was built for publication: An algorithm for optimal isomorphism between two random graphs

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