Login / Signup
An O(n³log n) deterministic and an O(n³) Las Vegs isomorphism test for trivalent graphs.
Zvi Galil
Christoph M. Hoffmann
Eugene M. Luks
Claus-Peter Schnorr
Andreas Weber
Published in:
J. ACM (1987)
Keyphrases
</>
graph theory
graph isomorphism
lower bound
graph matching
graph search
subgraph isomorphism
statistical tests
neural network
data mining
graph partitioning
graph theoretic
data sets
objective function
pattern recognition
graph structure