Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference40 articles.
1. Aleliunas, R., Karp, R. M., Lipton, R. J. Lovász, L., and Rackoff, C. Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems,Proc. 20th IEEE Symp. on Foundations of Computer Science, Puerto Rico, 1979, pp. 218–223.
2. Angluin, D., and L. G. Valiant, Fast Probabilistic Algorithms for Hamiltonian Paths and Matchings,J. Comput. System Sci.,18, 1979, 155–193.
3. Babai, L., and L. Kucera, Canonical Labelling of Graphs in Linear Average Time,Proc. 20th IEEE Symp. on Foundations of Computer Science, Puerto Rico, 1979, pp. 39–46.
4. Babai, L., Erdos, and S. M. Selkow, Random Graph Isomorphism,SIAM J. Comput.,9(3), 1980, 628–634.
5. Bollobas, B., The Evolution of Sparse Graphs, inGraph Theory & Combinatorics, Academic Press, London, 1984, pp. 35–57.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Glimpse at Paul G. Spirakis;Algorithms, Probability, Networks, and Games;2015
2. A comparative analysis of parallel computing approaches for genome assembly;Interdisciplinary Sciences: Computational Life Sciences;2011-03
3. An experimental study of algorithms for fully dynamic transitive closure;ACM Journal of Experimental Algorithmics;2008-06
4. A computational study of external-memory BFS algorithms;Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06;2006
5. Δ-stepping: a parallelizable shortest path algorithm;Journal of Algorithms;2003-10