An Efficient Algorithm for Graph Isomorphism
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Graph isomorphism, general remarks
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Complexity of finitely presented algebras
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Analytic sets in descriptive set theory and NP sets in complexity theory
Fundamenta Informaticae
Replicator Equations, Maximal Cliques, and Graph Isomorphism
Neural Computation
Analytic sets in Descriptive Set Theory and NP sets in Complexity Theory
Fundamenta Informaticae
| Hi-index | 0.00 |
A class of graphs called M-graphs is defined. It is shown thati) the problem of determining whether a given M-graph of order n2 has a clique of order n is logspace equivalent to graph isomorphism, andii) for any fixed but arbitrarily small e, the problem of determining whether a given M-graph of order n2 has a clique of order (1-e)n is NP complete.