{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:34:19Z","timestamp":1740123259864,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,6,28]],"date-time":"2017-06-28T00:00:00Z","timestamp":1498608000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,6,28]],"date-time":"2017-06-28T00:00:00Z","timestamp":1498608000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["LP110100166","DP150100618"],"award-info":[{"award-number":["LP110100166","DP150100618"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s10479-017-2571-7","type":"journal-article","created":{"date-parts":[[2017,6,28]],"date-time":"2017-06-28T18:17:11Z","timestamp":1498673831000},"page":"393-399","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A note on using the resistance-distance matrix to solve Hamiltonian cycle problem"],"prefix":"10.1007","volume":"261","author":[{"given":"V.","family":"Ejov","sequence":"first","affiliation":[]},{"given":"J. A.","family":"Filar","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8143-6583","authenticated-orcid":false,"given":"M.","family":"Haythorpe","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7024-0796","authenticated-orcid":false,"given":"J. F.","family":"Roddick","sequence":"additional","affiliation":[]},{"given":"S.","family":"Rossomakhine","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,28]]},"reference":[{"key":"2571_CR1","first-page":"111","volume":"20","author":"REL Aldred","year":"1999","unstructured":"Aldred, R. E. L., & Holton, D. (1999). Planar graphs, regular graphs, bipartite graphs and hamiltonicity. Australasian Journal of Combinatorics, 20, 111\u2013131.","journal-title":"Australasian Journal of Combinatorics"},{"key":"2571_CR2","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1177\/0165551511400946","volume":"37","author":"R Alguliev","year":"2011","unstructured":"Alguliev, R., Aliguliyev, R., & Ganjaliyev, F. (2011). Investigation the role of similarity measure and ranking algorithm in mining social network. Journal of Information Science, 37, 229\u2013234.","journal-title":"Journal of Information Science"},{"key":"2571_CR3","volume-title":"The traveling salesman problem: A computational study","author":"DL Applegate","year":"2006","unstructured":"Applegate, D. L., Bixby, R. B., Chav\u00e1tal, V., & Cook, W. J. (2006). The traveling salesman problem: A computational study. Princeton: Princeton University Press."},{"issue":"1","key":"2571_CR4","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1002\/qua.10057","volume":"90","author":"D Babi\u0107","year":"2002","unstructured":"Babi\u0107, D., Klein, D. J., Lukovits, I., Nikoli\u0107, S., & Trinajsti\u0107, N. (2002). Resistance-distance matrix: A computational algorithm and its application. International Journal of Quantum Chemistry, 90(1), 166\u2013176.","journal-title":"International Journal of Quantum Chemistry"},{"issue":"1","key":"2571_CR5","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s12532-013-0059-2","volume":"6","author":"P Baniasadi","year":"2014","unstructured":"Baniasadi, P., Ejov, V., Filar, J. A., Haythorpe, M., & Rossomakhine, S. (2014). Deterministic \u201cSnakes and Ladders\u201d Heuristic for the Hamiltonian cycle problem. Mathematical Programming Computation, 6(1), 55\u201375.","journal-title":"Mathematical Programming Computation"},{"key":"2571_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-981-7","volume-title":"Graphs and matrices","author":"RB Bapat","year":"2010","unstructured":"Bapat, R. B. (2010). Graphs and matrices. Berlin: Springer."},{"key":"2571_CR7","unstructured":"Chalaturnyk. A. (2008). A Fast Algorithm For Finding Hamilton Cycles. Masters Thesis, University of Manitoba."},{"key":"2571_CR8","first-page":"1716","volume":"3","author":"C Chennubhotla","year":"2007","unstructured":"Chennubhotla, C., & Bahar, I. (2007). Signal propagation in proteins and relation to equilibrium fluctuations. PLoS Computational Biology, 3, 1716\u20131726.","journal-title":"PLoS Computational Biology"},{"key":"2571_CR9","doi-asserted-by":"crossref","unstructured":"Doyle, P. G., & Snell, J. L. (1984). Random walks and electric networks. Mathematical Association of America.","DOI":"10.5948\/UPO9781614440222"},{"key":"2571_CR10","unstructured":"Eppstein, D. (2003). The traveling salesman problem for cubic graphs. In F. Dehne, J. R. Sack & M. Smid (Eds.), Algorithms and data struct., volume 2748 of Lecture Notes in Computer Science, (pp. 307\u2013318). Berlin: Springer."},{"issue":"2","key":"2571_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/jgt.21729","volume":"75","author":"H Fleischner","year":"2014","unstructured":"Fleischner, H. (2014). Uniquely Hamiltonian graphs of minimum degree 4. Journal of Graph Theory, 75(2), 167\u2013177.","journal-title":"Journal of Graph Theory"},{"issue":"2","key":"2571_CR12","first-page":"401","volume":"75","author":"PW Fowler","year":"2002","unstructured":"Fowler, P. W. (2002). Resistance distances in fullerene graphs. Croatica Chemica Acta, 75(2), 401\u2013408.","journal-title":"Croatica Chemica Acta"},{"issue":"1","key":"2571_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1002\/rsa.20542","volume":"47","author":"A Frieze","year":"2015","unstructured":"Frieze, A., & Haber, S. (2015). An almost linear time algorithm for finding Hamiltonian cycles in sparse random graphs with minimum degree at least three. Random Structures and Algorithms, 47(1), 73\u201398.","journal-title":"Random Structures and Algorithms"},{"key":"2571_CR14","doi-asserted-by":"publisher","unstructured":"Haythorpe, M. (2016). On the minimum number of Hamiltonian cycles in regular graphs. Experimental mathematics, to appear, 2017. doi:\n                    10.1080\/10586458.2017.1306813\n                    \n                  . \n                    http:\/\/arxiv.org\/abs\/1608.00713\n                    \n                  .","DOI":"10.1080\/10586458.2017.1306813"},{"key":"2571_CR15","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K. (2000). An effective implementation of Lin\u2013Kernighan traveling salesman heuristic. European Journal of Operations Research, 126, 106\u2013130.","journal-title":"European Journal of Operations Research"},{"key":"2571_CR16","doi-asserted-by":"publisher","first-page":"221","DOI":"10.2307\/2319844","volume":"82","author":"R Isaacs","year":"1975","unstructured":"Isaacs, R. (1975). Infinite families of non-trivial trivalent graphs which are not Tait colorable. American Mathematical Monthly, 82, 221\u2013239.","journal-title":"American Mathematical Monthly"},{"issue":"1","key":"2571_CR17","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF01164627","volume":"12","author":"DJ Klein","year":"1993","unstructured":"Klein, D. J., & Randi\u0107, M. (1993). Resistance distance. Journal of Mathematical Chemistry, 12(1), 81\u201395.","journal-title":"Journal of Mathematical Chemistry"},{"issue":"3","key":"2571_CR18","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/(SICI)1097-461X(1999)71:3<217::AID-QUA1>3.0.CO;2-C","volume":"71","author":"I Lukovits","year":"1999","unstructured":"Lukovits, I., Nikoli\u0107, S., & Trinajsti\u0107, N. (1999). Resistance distance in regular graphs. International Journal of Quantum Chemistry, 71(3), 217\u2013225.","journal-title":"International Journal of Quantum Chemistry"},{"issue":"50","key":"2571_CR19","doi-asserted-by":"publisher","first-page":"19885","DOI":"10.1073\/pnas.0706568104","volume":"104","author":"BH McRae","year":"2007","unstructured":"McRae, B. H., & Beier, P. (2007). Circuit theory predicts gene flow in plant and animal populations. Proceedings of the National Academy of Sciences of the United States of America, 104(50), 19885\u201319890.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"issue":"2","key":"2571_CR20","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/1097-461X(2001)81:2<135::AID-QUA4>3.0.CO;2-G","volume":"81","author":"JL Palacios","year":"2001","unstructured":"Palacios, J. L. (2001). Closed-form formulas for Kirchhoff index. International Journal of Quantum Chemistry, 81(2), 135\u2013140.","journal-title":"International Journal of Quantum Chemistry"},{"key":"2571_CR21","doi-asserted-by":"crossref","unstructured":"Rao, D., Yarowsky, D., & Callison-Burch, C. (2008). Affinity measures based on the graph Laplacian. In Proceeding of the 3rd Textgraphs workshop on graph-based algorithms for natural language processing (pp. 41\u201348). Association for Computation Linguistics.","DOI":"10.3115\/1627328.1627334"},{"issue":"6","key":"2571_CR22","doi-asserted-by":"publisher","first-page":"1913","DOI":"10.1137\/080734029","volume":"40","author":"DA Spielman","year":"2011","unstructured":"Spielman, D. A., & Srivastava, N. (2011). Graph sparsification by effective resistances. SIAM Journal on Computing, 40(6), 1913\u20131926.","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"2571_CR23","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/MNET.2010.5634437","volume":"24","author":"A Tizghadam","year":"2010","unstructured":"Tizghadam, A., & Alberto, L.-G. (2010). Betweenness centrality and resistance distance in communication networks. IEEE Network, 24(6), 10\u201316.","journal-title":"IEEE Network"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2571-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2571-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2571-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T15:39:10Z","timestamp":1589729950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2571-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,28]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["2571"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2571-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2017,6,28]]},"assertion":[{"value":"28 June 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}