{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:44:12Z","timestamp":1740123852863,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T00:00:00Z","timestamp":1571097600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T00:00:00Z","timestamp":1571097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s11276-019-02140-1","type":"journal-article","created":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T21:16:39Z","timestamp":1571174199000},"page":"979-989","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A heuristic search algorithm for Hamiltonian circuit problems in directed graphs"],"prefix":"10.1007","volume":"28","author":[{"given":"Dawei","family":"Jin","sequence":"first","affiliation":[]},{"given":"QingQin","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1828-5801","authenticated-orcid":false,"given":"Min","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,15]]},"reference":[{"key":"2140_CR1","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1112\/plms\/s3-24.4.739","volume":"24","author":"D Woodall","year":"1972","unstructured":"Woodall, D. (1972). Sufficient conditions for cycles in digraphs. Proceedings of the London Mathematical Society, 24, 739\u2013755.","journal-title":"Proceedings of the London Mathematical Society"},{"issue":"5","key":"2140_CR2","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/j.ejc.2011.09.030","volume":"33","author":"D K\u00fchn","year":"2012","unstructured":"K\u00fchn, D., & Osthus, D. (2012). A survey on Hamilton cycles in directed graphs. European Journal of Combinatorics, 33(5), 750\u2013766.","journal-title":"European Journal of Combinatorics"},{"key":"2140_CR3","unstructured":"Frieze, A. (2019). Hamilton cycles in random graphs: A bibliography. arXiv:1901.07139. Accessed 5 June 2019."},{"key":"2140_CR4","doi-asserted-by":"crossref","unstructured":"Alon, Y., & Krivelevich, M. (2019). Finding a Hamilton cycle fast on average using rotations-extensions. arXiv:1903.03007v1. Accessed 7 Mar 2019.","DOI":"10.1002\/rsa.20918"},{"key":"2140_CR5","doi-asserted-by":"publisher","unstructured":"Seeja, K. R. (2018). HybridHAM: A novel hybrid heuristic for finding Hamiltonian cycle. Journal of Optimization. https:\/\/doi.org\/10.1155\/2018\/9328103.","DOI":"10.1155\/2018\/9328103"},{"issue":"2","key":"2140_CR6","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0196-6774(88)90037-5","volume":"9","author":"AM Frieze","year":"1988","unstructured":"Frieze, A. M. (1988). An algorithm for finding Hamilton cycles in random directed graphs. Journal of Algorithms, 9(2), 181\u2013204.","journal-title":"Journal of Algorithms"},{"issue":"1","key":"2140_CR7","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/356022.356030","volume":"9","author":"S Martello","year":"1983","unstructured":"Martello, S. (1983). Algorithm 595: An enumerative algorithm for finding Hamiltonian circuits in a directed graph. ACM Transactions on Mathematical Software, 9(1), 131\u2013138.","journal-title":"ACM Transactions on Mathematical Software"},{"issue":"4","key":"2140_CR8","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/321850.321854","volume":"21","author":"F Rubin","year":"1974","unstructured":"Rubin, F. (1974). A search procedure for Hamilton paths and circuits. Journal of Association for Computing Machinery, 21(4), 576\u2013580.","journal-title":"Journal of Association for Computing Machinery"},{"issue":"10","key":"2140_CR9","doi-asserted-by":"publisher","first-page":"1809","DOI":"10.1360\/crad20051026","volume":"42","author":"W Zhonghua","year":"2005","unstructured":"Zhonghua, W., & Yunfei, J. (2005). An algorithm for finding all Hamiltonian cycles in digraph via hierarchical correlation. Journal of Computer Research and Development, 42(10), 1809\u20131814. (in Chinese) .","journal-title":"Journal of Computer Research and Development"},{"issue":"2","key":"2140_CR10","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","volume":"18","author":"D Angluin","year":"1977","unstructured":"Angluin, D., & Leslie, G. (1977). Fast probabilistic algorithms for Hamiltonian circuits and matchings. Journal of Computer & System Sciences, 18(2), 155\u2013193.","journal-title":"Journal of Computer & System Sciences"},{"issue":"3","key":"2140_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1109\/MNET.2019.1800339","volume":"33","author":"H Lu","year":"2019","unstructured":"Lu, H., Liu, G., Li, Y., Kim, H., & Serikawa, S. (2019). Cognitive internet of vehicles for automatic driving. IEEE Network, 33(3), 65\u201373.","journal-title":"IEEE Network"},{"key":"2140_CR12","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/s11036-017-0932-8","volume":"23","author":"H Lu","year":"2018","unstructured":"Lu, H., Li, Y., Chen, M., Kim, H., & Serikawa, S. (2018). Brain intelligence: Go beyond artificial intelligence. Mobile Networks and Applications, 23, 368\u2013375.","journal-title":"Mobile Networks and Applications"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-019-02140-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11276-019-02140-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-019-02140-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T06:05:48Z","timestamp":1645164348000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11276-019-02140-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,15]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["2140"],"URL":"https:\/\/doi.org\/10.1007\/s11276-019-02140-1","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"type":"print","value":"1022-0038"},{"type":"electronic","value":"1572-8196"}],"subject":[],"published":{"date-parts":[[2019,10,15]]},"assertion":[{"value":"15 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}