Optimum Featurs and Graph Isomorphism

DOI10.1109/TSMC.1974.5409142MaRDI QIDQ4063501zbMATH OpenOpenAlexFDO

Authors Yogesh J. Shah, George Davida, Michael K. McCarthy

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

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph theory (05C99) Algorithms in computer science (68W99) Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(7)

• A fast backtrack algorithm for graph isomorphism
• Topological code of graphs
• Efficient graph automorphism by vertex partitioning
• Some further development on the eigensystem approach for graph isomorphism detection
• Algorithms for finding directed graph isomorphisms by finite automata
• Initial vertex partitioning and testing isomorphism of graphs and digraphs
• Number synthesis of kinematic chains based on permutation groups

This page was built for publication: Optimum Featurs and Graph Isomorphism

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