Funder
Fundamental Research Funds for the Central Universities
Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering,Computer Networks and Communications,Information Systems
Reference12 articles.
1. Woodall, D. (1972). Sufficient conditions for cycles in digraphs. Proceedings of the London Mathematical Society, 24, 739–755.
2. Kühn, D., & Osthus, D. (2012). A survey on Hamilton cycles in directed graphs. European Journal of Combinatorics, 33(5), 750–766.
3. Frieze, A. (2019). Hamilton cycles in random graphs: A bibliography.
arXiv:1901.07139
. Accessed 5 June 2019.
4. Alon, Y., & Krivelevich, M. (2019). Finding a Hamilton cycle fast on average using rotations-extensions.
arXiv:1903.03007v1
. Accessed 7 Mar 2019.
5. Seeja, K. R. (2018). HybridHAM: A novel hybrid heuristic for finding Hamiltonian cycle. Journal of Optimization.
https://doi.org/10.1155/2018/9328103
.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献