GIT—a heuristic program for testing pairs of directed line graphs for isomorphism

DOI10.1145/363872.363899zbMath0123.33710OpenAlexW1971184080MaRDI QIDQ5736478

S. H. Unger

Publication date: 1964

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/363872.363899

zbMATH Keywords

numerical analysis

Related Items (21)

A fast backtrack algorithm for graph isomorphism ⋮ Unification theory ⋮ An algorithm for determining the automorphism partitioning of an undirected graph ⋮ Topological code of graphs ⋮ A new algorithm for digraph isomorphism ⋮ THE CHARACTERIZATION OF BINARY RELATION HOMOMORPHISMS ⋮ Zur Bestimmung der Automorphismen eines endlichen Graphen ⋮ Consistency in networks of relations ⋮ Algorithms for finding directed graph isomorphisms by finite automata ⋮ Iterative Equitable Partition of Graph as a Model of Constant Structure Discrete Time Closed Semantic System ⋮ 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) ⋮ Ein Verfahren zur Feststellung der Isomorphie von endlichen, zusammenhängenden Graphen. (A method to establish the isomorphy of finite connected graphs.) ⋮ Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi ⋮ Normalformen planarer Graphen. II ⋮ A note on the derivation of maximal common subgraphs of two directed or undirected graphs ⋮ Efficient graph automorphism by vertex partitioning ⋮ Graph isomorphism: A heuristic edge-partitioning-oriented algorithm ⋮ A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs ⋮ Graph fibrations, graph isomorphism, and PageRank ⋮ Graph isomorphism problem ⋮ Search for a unique incidence matrix of a graph

This page was built for publication: GIT—a heuristic program for testing pairs of directed line graphs for isomorphism