An Efficient Algorithm for Graph Isomorphism
From MaRDI portal
Publication:5597464
DOI10.1145/321556.321562zbMath0199.27801OpenAlexW2154878346MaRDI QIDQ5597464
Derek Gordon Corneil, Calvin C. Gotlieb
Publication date: 1970
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321556.321562
Related Items
Characterizing and computing weight-equitable partitions of graphs, FACTOR MAPS OF LAMBDA-GRAPH SYSTEMS AND INCLUSIONS OF C*-ALGEBRAS, A fast backtrack algorithm for graph isomorphism, An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants, Strong tree-cographs are Birkhoff graphs, A novel clustering method based on quasi-consensus motions of dynamical multiagent systems, Can abstract state machines be useful in language theory?, A note on cospectral graphs, Computational complexity of reconstruction and isomorphism testing for designs and line graphs, An algorithm for determining the automorphism partitioning of an undirected graph, Relational consistency algorithms and their application in finding subgraph and graph isomorphisms, Strongly regular graphs having strongly regular subconstituents, Computational complexity of covering three-vertex multigraphs, Parameterized Counting and Cayley Graph Expanders, The road problem and homomorphisms of directed graphs, Bypass strong V-structures and find an isomorphic labelled subgraph in linear time, A computational approach to construct a multivariate complete graph invariant, Generating the Nine-Point Graphs, Practical graph isomorphism. II., Partitioning a graph in \(O(|A|\log_ 2|V|)\), Unnamed Item, Locally constrained graph homomorphisms -- structure, complexity, and applications, A note on compact graphs, Isomorphism testing via polynomial-time graph extensions, Self-organized Anonymous Authentication in Mobile Ad Hoc Networks, Topological code of graphs, Compact graphs and equitable partitions, Block transitivity and degree matrices, A versatile system for computer-controlled assembly, A V log V algorithm for isomorphism of triconnected planar graphs, A new algorithm for digraph isomorphism, Computer generation of vertex graphs, THE CHARACTERIZATION OF BINARY RELATION HOMOMORPHISMS, Zur Bestimmung der Automorphismen eines endlichen Graphen, Algorithm for generating graphs of a given partition, Generalized median graphs and applications, Further annotated bibliography on the isomorphism disease, Algorithms for finding directed graph isomorphisms by finite automata, Hashing and canonicalizing Notation 3 graphs, The graph isomorphism disease, Zerlegung der Knotenmengen von Graphen zum Nachweis der Isomorphie, Block elimination distance, Block elimination distance, A graph isomorphism algorithm for object recognition, An algorithm for drawing general undirected graphs, A weighted graph embedding technique and its application to automatic circuit layout, Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi, A technique for graph embedding with constraints on node and arc correspondences, 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, A new algorithm for solving the tree isomorphism problem, Graph isomorphism: A heuristic edge-partitioning-oriented algorithm, A method of determining graph isomorphism, Sherali-Adams relaxations of graph isomorphism polytopes, Graph fibrations, graph isomorphism, and PageRank, Graph isomorphism problem, Graph isomorphism and theorems of Birkhoff type, Search for a unique incidence matrix of a graph, Isomorphism Test for Digraphs with Weighted Edges., Graph recurrence
