Graph isomorphism, general remarks
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
On determining the genus of a graph in O(v O(g)) steps(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
Graph Theory With Applications
Graph Theory With Applications
Faster isomorphism testing of strongly regular graphs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Isomorphism testing for embeddable graphs through definability
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
An Heuristic for Graph Symmetry Detection
GD '99 Proceedings of the 7th International Symposium on Graph Drawing
European Journal of Combinatorics
Isomorphism of graphs with bounded eigenvalue multiplicity
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Isomorphism testing for graphs of bounded genus
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Graph and map isomorphism and all polyhedral embeddings in linear time
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Complete enumeration of compact structural motifs in proteins
ISB '10 Proceedings of the International Symposium on Biocomputing
Motorcycle graphs: canonical quad mesh partitioning
SGP '08 Proceedings of the Symposium on Geometry Processing
Fast digital signature algorithm based on subgraph isomorphism
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
From invariants to canonization in parallel
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Errors in graph embedding algorithms
Journal of Computer and System Sciences
From polynomial time queries to graph structure theory
Communications of the ACM
Fixed-point definability and polynomial time on chordal graphs and line graphs
Fields of logic and computation
Isomorphism Testing via Polynomial-Time Graph Extensions
Journal of Mathematical Modelling and Algorithms
Isomorphism of (mis)labeled graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
On graph isomorphism for restricted graph classes
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Testing graph isomorphism in parallel by playing a game
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Isomorphism for graphs of bounded feedback vertex set number
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Structure theorem and isomorphism test for graphs with excluded topological subgraphs
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Fixed-point definability and polynomial time on graphs with excluded minors
Journal of the ACM (JACM)
Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
The Graph Isomorphism Problem and approximate categories
Journal of Symbolic Computation
Practical graph isomorphism, II
Journal of Symbolic Computation
| Hi-index | 0.02 |
The isomorphism problem for graphs has been in recent years the object of a much research (see e.g. [Col 78] or [Re-Cor 77]). Its complexity is still unknown. It is not known whether the problem is NP-complete, although it is NP, of course. It is not known whether there exists a polynomial-time algorithm for it. Recently, Babai [Ba 79] has discussed probabilistic algorithms. For additional information see also [Mi 77]. The problem has also some practical applications. Of the known algorithms let us only quote the work of Weinberg [We 66] and of Hopcroft and Tarjan [Ho-Ta 72]. Weinberg's algorithm rums in quadratic time (in &agr;o, the number of vertices of the graphs). Hopcroft and Tarjan's runs in time 0(&agr;o log&agr;o) and uses their powerful technique of depth-first search. Both these algorithms apply only to planar (Weinberg's only to 3-connected planar) graphs. They rely on a well-known rigidity theorem of Withney [Withney 32].