Graph isomorphism: A heuristic edge-partitioning-oriented algorithm

DOI10.1007/BF02253334zbMath0281.68022OpenAlexW178894928MaRDI QIDQ1843304

Yanyan Li

Publication date: 1974

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02253334

Mathematics Subject Classification ID

Graph theory (05C99) Algorithms in computer science (68W99)

Related Items

A new algorithm for digraph isomorphism, Zur Bestimmung der Automorphismen eines endlichen Graphen, Algorithms for finding directed graph isomorphisms by finite automata, Zerlegung der Knotenmengen von Graphen zum Nachweis der Isomorphie, Efficient graph automorphism by vertex partitioning, A method of determining graph isomorphism, Graph isomorphism problem

Cites Work

• Un metodo euristico per la verifica dell'isomorfismo di due grafi semplici non orientati. (A heuristic method for determinating the isomorphism of two simple non-oriented graphs)
• Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi
• Approximation des équations d'évolution du premier ordre en t par des schemas à un degré de liberte
• Orthogonal Matrices with Zero Diagonal
• An Efficient Algorithm for Graph Isomorphism
• GIT—a heuristic program for testing pairs of directed line graphs for isomorphism