Improved random graph isomorphism

Journal of Discrete Algorithms

Volumn 6, Issue 1, 2008, Pages 85-92

  Czajka, Tomek ^a   Pandurangan, Gopal ^a  

^a Purdue University   (United States)

Author keywords

Canonical labeling; Graph isomorphism; Martingale analysis; Random graphs

Indexed keywords

ALGORITHMS; INVARIANCE; PROBLEM SOLVING; RANDOM PROCESSES;

CANONICAL LABELING; GRAPH ISOMORPHISM; MARTINGALE ANALYSIS; RANDOM GRAPHS;

GRAPH THEORY;

EID: 39149124844     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2007.01.002     Document Type: Article

References (11)

1. Babai L., Erdo{combining double acute accent}s P., and Selkow S.M. Random graph isomorphism. SIAM J. Computing 9 3 (1980) 628-635
2. L. Babai and L. Kučera, Canonical labelling of graphs in linear average time, in: Proc. of 20th Annual IEEE Symp. on Foundations of Computational Science, Puerto Rico, 1979, pp. 39-46
3. L. Babai and E. Luks, Canonical labeling of graphs, in: Proc. of 15th ACM Symp. on Theory of Computing, 1983, pp. 171-183
4. Bollobás B. Random Graphs (2001), Cambridge University Press, Cambridge
5. B. Bollobás, Distinguishing vertices of random graphs, Ann. Discrete Math. 13, 33-50
6. Frieze A., and McDiarmid C. Algorithmic theory of random graphs. Random Structures and Algorithms 10 (1997) 5-42
7. Karp R. Probabilistic analysis of a canonical numbering algorithm for graphs. Proc. Symposia in Pure Math. vol. 34 (1979), American Mathematical Society, Providence, RI 365-378
8. Knuth D. The Art of Programming: Sorting and Searching (1998), Addison-Wesley, Reading, MA
9. R. Lipton, The beacon set approach to graph isomorphism, Yale University, Preprint no. 135, 1978
10. Mitzenmacher M., and Upfal E. Probability and Computing: Randomized Algorithms and Probabilistic Analysis (2005), Cambridge University Press, Cambridge
11. Motwani R., and Raghavan P. Randomized Algorithms (1995), Cambridge University Press, Cambridge