Learn More
Canonical labeling of a graph consists of assigning a unique label to each ver-tex such that the labels are invariant under isomorphism. Such a labeling can be used to solve the graph isomorphism problem. We give a simple, linear time, high probability algorithm for the canonical labeling of a G(n, p) random graph for p ∈ ω ln 4 n/n ln ln n , 1 − ω ln 4 n/n(More)
  • 1