Weisfeiler-Lehman Refinement Requires at Least a Linear Number of Iterations
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Computing and Drawing Isomorphic Subgraphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Graph and map isomorphism and all polyhedral embeddings in linear time
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Canonical labeling of regular graphs in linear average time
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Representation and Structure-Based Similarity Assessment for Agile Workflows
ICCBR '07 Proceedings of the 7th international conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
Resisting structural re-identification in anonymized social networks
Proceedings of the VLDB Endowment
Fast Algorithm for Graph Isomorphism Testing
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Experience management: foundations, development methodology, and internet-based applications
Experience management: foundations, development methodology, and internet-based applications
A logspace algorithm for partial 2-tree canonization
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Resisting structural re-identification in anonymized social networks
The VLDB Journal — The International Journal on Very Large Data Bases
Complexity classes of equivalence problems revisited
Information and Computation
Weisfeiler-Lehman Graph Kernels
The Journal of Machine Learning Research
On an optimal randomized acceptor for graph nonisomorphism
Information Processing Letters
Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
On the automorphism groups of strongly regular graphs I
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |
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.