Author:
Karpiński Marek,Ruciński Andrzej,Szymańska Edyta
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Alon, N., Spencer, J.H.: The Probabilistic Method, 3rd edn. Wiley, Chichester (2008)
2. Angluin, D., Valiant, L.: Fast probabilistic algorithms for Hamiltonian circuits and matchings. J. Comput. System Sci. 18, 155–193 (1979)
3. Bermond, J.C., et al.: Hypergraphes hamiltoniens. Prob. Comb. Theorie Graph Orsay 260, 39–43 (1976)
4. Bollobas, B., Fenner, T.I., Frieze, A.: An algorithm for finding hamiltonian cycles in random graphs. In: Proceedings of the 17th Annual ACM Symposium on Theory of Computing, pp. 430–439 (1985)
5. Broder, A., Frieze, A., Shamir, E.: Finding hidden Hamilton cycles. Random Structures Algorithms 5, 395–410 (1994)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献