Canonical labelling of graphs in linear average time
暂无分享,去创建一个
Canonical labelling of graphs (CL, for short) can be used, e.g., to test isomorphism. We prove that a simple vertex classification procedure results after only two refinement steps in a CL of random graphs with probability 1 - exp(-cn). With a slight modification we obtain a linear time CL algorithm with only exp(-cn log n/log log n) probability of failure. An additional depth-first search yields a CL of all graphs in linear average time.
[1] László Babai,et al. On the Complexity of Canonical Labeling of Strongly Regular Graphs , 1980, SIAM J. Comput..
[2] Narsingh Deo,et al. A new algorithm for digraph isomorphism , 1977 .
[3] Volker Strassen,et al. A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..
[4] Paul Erdös,et al. Random Graph Isomorphism , 1980, SIAM J. Comput..