The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
STACS '85 Proceedings of the 2nd Symposium of Theoretical Aspects of Computer Science
Normal forms for trivalent graphs and graphs of bounded valence
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Canonical labelling of graphs in linear average time
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Isomorphism of graphs of bounded valence can be tested in polynomial time
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
An O(n3 log n) deterministic and an O (n 3) probabilistic isomorphism test for trivalent graphs
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Computational complexity and the classification of finite simple groups
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Weisfeiler-Lehman Refinement Requires at Least a Linear Number of Iterations
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Sherali-Adams relaxations and indistinguishability in counting logics
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
| Hi-index | 0.00 |
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.