Optimum Featurs and Graph Isomorphism
From MaRDI portal
Publication:4063501
DOI10.1109/TSMC.1974.5409142zbMath0306.05133OpenAlexW2087148058MaRDI QIDQ4063501
Michael K. McCarthy, Yogesh J. Shah, George Davida
Publication date: 1974
Published in: IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tsmc.1974.5409142
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
A fast backtrack algorithm for graph isomorphism ⋮ Number synthesis of kinematic chains based on permutation groups ⋮ Topological code of graphs ⋮ Algorithms for finding directed graph isomorphisms by finite automata ⋮ Initial vertex partitioning and testing isomorphism of graphs and digraphs ⋮ Efficient graph automorphism by vertex partitioning ⋮ Some further development on the eigensystem approach for graph isomorphism detection
This page was built for publication: Optimum Featurs and Graph Isomorphism
