A Graph Isomorphism Algorithm Using Pseudoinverses

Bit Foundation
Publication Type:
Journal Article
Bit, 1996, 36 pp. 41 - 53
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
2006014610OK.pdf646.68 kB
Adobe PDF
For a graph of m nodes and n edges, an algorithm for testing the isomorphism of graphs is given. The complexity of the algorithm is a maximum of O(mn(2)) in almost all cases, with a considerable reduction if sparsity is exploited. If isomorphism is prese
Please use this identifier to cite or link to this item: