An Efficient Algorithm for Graph Isomorphism
Journal of the ACM (JACM)
A Backtrack Procedure for Isomorphism of Directed Graphs
Journal of the ACM (JACM)
GIT—a heuristic program for testing pairs of directed line graphs for isomorphism
Communications of the ACM
Communications of the ACM
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
A large database of graphs and its use for benchmarking graph isomorphism algorithms
Pattern Recognition Letters - Special issue: Graph-based representations in pattern recognition
On the nlog n isomorphism technique (A Preliminary Report)
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A sketching interface for articulated figure animation
Proceedings of the 2003 ACM SIGGRAPH/Eurographics symposium on Computer animation
Application-specific instruction generation for configurable processor architectures
FPGA '04 Proceedings of the 2004 ACM/SIGDA 12th international symposium on Field programmable gate arrays
Exact and Approximate Graph Matching Using Random Walks
IEEE Transactions on Pattern Analysis and Machine Intelligence
Finding a suitable checkpoint and recovery protocol for a distributed application
Journal of Parallel and Distributed Computing - Special issue: 18th International parallel and distributed processing symposium
A sketching interface for articulated figure animation
ACM SIGGRAPH 2006 Courses
A sketching interface for articulated figure animation
ACM SIGGRAPH 2007 courses
Efficient graph automorphism by vertex partitioning
Artificial Intelligence
Graph based shapes representation and recognition
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
Reconstruction of networks from their betweenness centrality
Evo'08 Proceedings of the 2008 conference on Applications of evolutionary computing
Object recognition through topo-geometric shape models using error-tolerant subgraph isomorphisms
IEEE Transactions on Image Processing
Isomorphism Testing via Polynomial-Time Graph Extensions
Journal of Mathematical Modelling and Algorithms
A sketch-based articulated figure animation tool
Proceedings of the South African Institute of Computer Scientists and Information Technologists Conference on Knowledge, Innovation and Leadership in a Diverse, Multidisciplinary Environment
The RW2 algorithm for exact graph matching
ICAPR'05 Proceedings of the Third international conference on Advances in Pattern Recognition - Volume Part I
A consistency rule for graph isomorphism problem
Proceedings of the 27th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
A backtracking algorithm for testing a pair of digraphs for isomorphism is presented. The information contained in the distance matrix representation of a graph is used to establish an initial partition of the graph's vertices. This distance matrix information is then applied in a backtracking procedure to reduce the search tree of possible mappings. While the algorithm is not guaranteed to run in polynomial time, it performs efficiently for a large class of graphs.