Graph isomorphism: A heuristic edge-partitioning-oriented algorithm

DOI10.1007/BF02253334MaRDI QIDQ1843304zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• An Efficient Algorithm for Graph Isomorphism
• Approximation des équations d'évolution du premier ordre en t par des schemas à un degré de liberte
• GIT—a heuristic program for testing pairs of directed line graphs for isomorphism
• Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi
• Orthogonal Matrices with Zero Diagonal
• 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)

Cited in

(7)

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

This page was built for publication: Graph isomorphism: A heuristic edge-partitioning-oriented algorithm

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