Abstract :
An algorithm is presented to compute a canonical form of regular graphs. There is a constant c such that for each constant d the average running time of the algorithm over all d-regular graphs with N vertices is not greater than cNd, provided N is sufficiently large.
Keywords :
"Labeling","Polynomials","Testing","Computer science","Mathematics","Heuristic algorithms","Computational complexity","Partitioning algorithms"
