An Efficient Algorithm for Graph Isomorphism
From MaRDI portal
(Redirected from Publication:5597464)
Cited in
(68)- Graph isomorphism problem
- Graph isomorphism and theorems of Birkhoff type
- A fast backtrack algorithm for graph isomorphism
- Strong tree-cographs are Birkhoff graphs
- A note on cospectral graphs
- Relational consistency algorithms and their application in finding subgraph and graph isomorphisms
- Strongly regular graphs having strongly regular subconstituents
- Partitioning a graph in \(O(|A|\log_ 2|V|)\)
- A note on compact graphs
- Topological code of graphs
- A versatile system for computer-controlled assembly
- Computer generation of vertex graphs
- Zur Bestimmung der Automorphismen eines endlichen Graphen
- Algorithm for generating graphs of a given partition
- Zerlegung der Knotenmengen von Graphen zum Nachweis der Isomorphie
- A graph isomorphism algorithm for object recognition
- A novel clustering method based on quasi-consensus motions of dynamical multiagent systems
- An algorithm for drawing general undirected graphs
- Efficient graph automorphism by vertex partitioning
- Graph isomorphism: A heuristic edge-partitioning-oriented algorithm
- Graph recurrence
- Characterizing and computing weight-equitable partitions of graphs
- A V log V algorithm for isomorphism of triconnected planar graphs
- Generalized median graphs and applications
- Sherali-Adams relaxations of graph isomorphism polytopes
- Practical graph isomorphism. II.
- 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
- Further annotated bibliography on the isomorphism disease
- Graph fibrations, graph isomorphism, and PageRank
- Self-organized anonymous authentication in mobile ad hoc networks
- An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
- A method of determining graph isomorphism
- Algorithms for finding directed graph isomorphisms by finite automata
- A new algorithm for digraph isomorphism
- THE CHARACTERIZATION OF BINARY RELATION HOMOMORPHISMS
- The graph isomorphism disease
- Locally constrained graph homomorphisms -- structure, complexity, and applications
- Search for a unique incidence matrix of a graph
- Generating the Nine-Point Graphs
- FACTOR MAPS OF LAMBDA-GRAPH SYSTEMS AND INCLUSIONS OF C*-ALGEBRAS
- Isomorphism test for digraphs with weighted edges
- An algorithm for determining the automorphism partitioning of an undirected graph
- Block transitivity and degree matrices
- Block elimination distance
- Block elimination distance
- On the complexity of identifying strongly regular graphs
- Parameterized Counting and Cayley Graph Expanders
- The road problem and homomorphisms of directed graphs
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs
- Bypass strong V-structures and find an isomorphic labelled subgraph in linear time
- Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)
- Distance measures for geometric graphs
- Isomorphism testing via polynomial-time graph extensions
- Compact graphs and equitable partitions
- Computational complexity of covering coloured mixed multigraphs with simple degree partitions
- Computational complexity of covering multigraphs with semi-edges: small cases
- The complexity of theorem-proving procedures
- A novel approach to covers of multigraphs with semi-edges
- Detecting and counting small subgraphs, and evaluating a parameterized Tutte polynomial: lower bounds via toroidal grids and Cayley graph expanders
- A new algorithm for solving the tree isomorphism problem
- Can abstract state machines be useful in language theory?
- Computational complexity of covering three-vertex multigraphs
- A computational approach to construct a multivariate complete graph invariant
- Hashing and canonicalizing Notation 3 graphs
This page was built for publication: An Efficient Algorithm for Graph Isomorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5597464)
