Randomized algorithms
Algorithmic theory of random graphs
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Fast Algorithm for Graph Isomorphism Testing
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Improved automated reaction mapping
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Faster reaction mapping through improved naming techniques
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |
Canonical labeling of a graph consists of assigning a unique label to each vertex 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@?[@w(ln^4n/nlnlnn),1-@w(ln^4n/nlnlnn)]. Our result covers a gap in the range of p in which no algorithm was known to work with high probability. Together with a previous result by Bollobas, the random graph isomorphism problem can be solved efficiently for p@?[@Q(lnn/n),1-@Q(lnn/n)].