Isomorphism of graphs with bounded eigenvalue multiplicity
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Hypergraph isomorphism and structural equivalence of Boolean functions
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Efficient extraction of mapping rules of atoms from enzymatic reaction data
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Canonical labeling of regular graphs in linear average time
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Complexity classes of equivalence problems revisited
Information and Computation
Faster reaction mapping through improved naming techniques
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |
A function f is defined, mapping graphs with n vertices onto graphs with vertex set {1,...,n} . f(X) is isomorphic to X and X is isomorphic to Y iff f(X) &equil; f(Y). For each d, the restriction of f to graphs of valence d is computable in time O(n&tgr;(d)) for a suitable integer &tgr;(d). For d 3, the proof uses a recent result of L. Babai, P.J. Cameron and P.P. Pálfy on the order of primitive groups with bounded composition factors; for the trivalent case a more elementary proof is presented.