Refined Vertex Codes and Vertex Partitioning Methodology for Graph Isomorphism Testing

DOI10.1109/TSMC.1980.4308365MaRDI QIDQ3899526zbMATH OpenOpenAlexFDO

Authors Kabekode V. S. Bhat

Publication date 1980

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.1980.4308365

zbMATH Keywords

initial vertex partitioning

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(4)

• A fast backtrack algorithm for graph isomorphism
• An algorithm for matrix symmetrization
• Pattern associativity and the retrieval of semantic networks
• Efficient graph automorphism by vertex partitioning

This page was built for publication: Refined Vertex Codes and Vertex Partitioning Methodology for Graph Isomorphism Testing

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