A fast backtrack algorithm for graph isomorphism

DOI10.1016/0020-0190(88)90037-3zbMath0652.05023OpenAlexW1964028031MaRDI QIDQ1106855

Hari Ballabh Mittal

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90037-3

zbMATH Keywords

recursive proceduredigraphsdegree sequencesearch treedistance matricesisomorphism testingbacktrack algorithminitial partitioning of vertices

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Related Items

An algorithm for drawing general undirected graphs

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• Parallel concepts in graph theory
• A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem
• Refined Vertex Codes and Vertex Partitioning Methodology for Graph Isomorphism Testing
• A Backtrack Procedure for Isomorphism of Directed Graphs
• Optimum Featurs and Graph Isomorphism
• A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices
• A new algorithm for digraph isomorphism
• The graph isomorphism disease
• Distance matrix of a graph and its realizability
• Backtrack Programming
• An Efficient Algorithm for Graph Isomorphism
• GIT—a heuristic program for testing pairs of directed line graphs for isomorphism