{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:39:01Z","timestamp":1740123541436,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T00:00:00Z","timestamp":1648598400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T00:00:00Z","timestamp":1648598400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s11227-022-04409-3","type":"journal-article","created":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T10:03:07Z","timestamp":1648634587000},"page":"14164-14190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An improved ant-based heuristic approach for solving the longest cycle problem in large-scale complex networks"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5239-8896","authenticated-orcid":false,"given":"Ping","family":"Guo","sequence":"first","affiliation":[]},{"given":"Yicheng","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,30]]},"reference":[{"key":"4409_CR1","unstructured":"Diestel R (2005) Graph Theory (Graduate Texts in Mathematics). Heidelberg, Springer, Berlin"},{"issue":"2","key":"4409_CR2","first-page":"340","volume":"44","author":"MR Garey","year":"1979","unstructured":"Garey MR (1979) Computers and intractability: a guide to the theory of np-completeness. Revista Da Escola De Enfermagem Da USP 44(2):340","journal-title":"Revista Da Escola De Enfermagem Da USP"},{"issue":"1","key":"4409_CR3","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1137\/0205007","volume":"5","author":"P Mateti","year":"1976","unstructured":"Mateti P, Deo N (1976) On algorithms for enumerating all circuits of a graph. SIAM J Comput 5(1):90\u201399","journal-title":"SIAM J Comput"},{"issue":"3","key":"4409_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1137\/0202017","volume":"2","author":"R Tarjan","year":"1973","unstructured":"Tarjan R (1973) Enumeration of the elementary circuits of a directed graph. SIAM J Comput 2(3):211\u2013216","journal-title":"SIAM J Comput"},{"key":"4409_CR5","unstructured":"Liu H, Wang J (2006) A new way to enumerate cycles in graph. Advanced Int\u20191 Conference on Telecommunications and Int\u20191 Conference on Internet and Web Applications and Services (AICT-ICIW\u201906). Guadeloupe, French Caribbean, pp 57\u201357"},{"issue":"4","key":"4409_CR6","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/637411.637426","volume":"31","author":"W Jie","year":"2002","unstructured":"Jie W, Watts DJ (2002) Small worlds: the dynamics of networks between order and randomness. Acm Sigmod Record 31(4):74\u201375","journal-title":"Acm Sigmod Record"},{"key":"4409_CR7","first-page":"189","volume-title":"Australian Conference on Artificial Life (ACAL\u201907)","author":"K Hawick","year":"2007","unstructured":"Hawick K, James H, Scogings C (2007) Structural circuits and attractors in kauffman networks. Australian Conference on Artificial Life (ACAL\u201907). Gold Coast, Australia, pp 189\u2013200"},{"issue":"2","key":"4409_CR8","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1002\/net.3230060206","volume":"6","author":"ET Dixon","year":"1976","unstructured":"Dixon ET, Goodman Seymour E (1976) An algorithm for the longest cycle problem. Networks 6(2):139\u2013149","journal-title":"Networks"},{"issue":"125","key":"4409_CR9","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.knosys.2017.03.022","volume":"100","author":"D Chalupa","year":"2017","unstructured":"Chalupa D, Balaghan P, Hawick KA, Gordon NA (2017) Computational methods for finding long simple cycles in complex networks. Knowl Based Syst 100(125):96\u2013107","journal-title":"Knowl Based Syst"},{"key":"4409_CR10","unstructured":"Chalupa D, Balaghan P, Hawick KA (2018) A probabilistic ant-based heuristic for the longest simple cycle problem in complex net- works. arXiv:1801.09227"},{"key":"4409_CR11","unstructured":"Kumar P, Gupta N (2014) A heuristic algorithm for longest simple cycle problem. In: Proceedings of the International Conference on Wireless Networks (ICWN\u201914), Venice , Italy. pp 202-208"},{"key":"4409_CR12","doi-asserted-by":"publisher","unstructured":"Sun Y, Cao Q, Wang B, Li S (2018) Sum rate maximization of d2d communications in cognitive radio network using cheating strategy. Wireless Communications & Mobile Computing, article ID 6065920. https:\/\/doi.org\/10.1155\/2018\/6065920","DOI":"10.1155\/2018\/6065920"},{"issue":"1","key":"4409_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1993.1001","volume":"14","author":"HL Bodlaender","year":"1993","unstructured":"Bodlaender HL (1993) On linear time minor tests with depth-first search. J Algorithms 14(1):1\u201323","journal-title":"J Algorithms"},{"issue":"1","key":"4409_CR14","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BF02523689","volume":"18","author":"D Karger","year":"1997","unstructured":"Karger D, Motwani R, Ramkumar GDS (1997) On approximating the longest path in a graph. Algorithmica 18(1):82\u201398","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"4409_CR15","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0012-365X(93)E0142-Q","volume":"137","author":"MC Li","year":"1995","unstructured":"Li MC (1995) Longest cycles in regular 2-connected claw-free graphs. Dis-crete Math 137(1\u20133):277\u2013295","journal-title":"Dis-crete Math"},{"issue":"7","key":"4409_CR16","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1016\/j.disc.2007.03.070","volume":"308","author":"D Paulusma","year":"2008","unstructured":"Paulusma D, Yoshimoto K (2008) Relative length of longest paths and longest cycles in triangle-free graphs. Discret Math 308(7):1222\u20131229","journal-title":"Discret Math"},{"issue":"5","key":"4409_CR17","doi-asserted-by":"publisher","first-page":"1596","DOI":"10.1137\/S0097539701395486","volume":"31","author":"T Feder","year":"2002","unstructured":"Feder T, Motwani R, Subi C (2002) Approximating the longest cycle problem in sparse graphs. SIAM J Comput 31(5):1596\u20131607","journal-title":"SIAM J Comput"},{"key":"4409_CR18","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1007\/11533719_88","volume-title":"International Computing and Combinatorics Conference (COCOON\u201905)","author":"G Chen","year":"2005","unstructured":"Chen G, Gao Z, Xingxing Y, Zang W (2005) Approximating the longest cycle problem on graphs with bounded degree. International Computing and Combinatorics Conference (COCOON\u201905). Kunming, China, pp 870\u2013884"},{"issue":"204","key":"4409_CR19","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.dam.2015.10.022","volume":"100","author":"AA Sardroud","year":"2016","unstructured":"Sardroud AA, Bagheri A (2016) An approximation algorithm for the longest cycle problem in solid grid graphs. Discrete Appl Math 100(204):6\u201312","journal-title":"Discrete Appl Math"},{"issue":"2","key":"4409_CR20","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1093\/ietisy\/e91-d.2.170","volume":"91","author":"Y Takahara","year":"2008","unstructured":"Takahara Y, Teramoto S, Uehara R (2008) Longest path problems on ptolemaic graphs. IEICE Trans Inf Syst 91(2):170\u2013177","journal-title":"IEICE Trans Inf Syst"},{"key":"4409_CR21","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.tcs.2021.01.005","volume":"859","author":"J Shang","year":"2021","unstructured":"Shang J, Li P, Shi Y (2021) The longest cycle problem is polynomial on interval graphs. Theoret Comput Sci 859:37\u201347","journal-title":"Theoret Comput Sci"},{"key":"4409_CR22","doi-asserted-by":"crossref","unstructured":"Liu C, Li H, Leonce A, Burge L, Trimble J, Keiller P, Yakubu AA (2010) A Heuristic Algorithm for Finding the Longest Pathways in a Biochemical Network. The Ninth International Conference on Machine Learning and Applications. DC, USA, Washington, pp 515\u2013522","DOI":"10.1109\/ICMLA.2010.81"},{"key":"4409_CR23","doi-asserted-by":"crossref","unstructured":"Adriaens F, Aslay C, De Bie T, Gionis A, Lijffijt J (2019) Discovering interesting cycles in directed graphs. In: Proceedings of the 28th ACM International Conference on Information and Knowledge Management, NewYork, US, pp. 1191\u20131200","DOI":"10.1145\/3357384.3357970"},{"issue":"5","key":"4409_CR24","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1093\/bioinformatics\/17.5.461","volume":"17","author":"MY Becker","year":"2001","unstructured":"Becker MY, Rojas I (2001) A graph layout algorithm for drawing metabolic pathways. Bioinformatics 17(5):461\u2013467","journal-title":"Bioinformatics"},{"issue":"5","key":"4409_CR25","doi-asserted-by":"publisher","first-page":"056106","DOI":"10.1103\/PhysRevE.79.056106","volume":"79","author":"X Ma","year":"2009","unstructured":"Ma X, Huang L, Lai YC, Zheng Z (2009) Emergence of loop structure in scale-free networks and dynamical consequences. Phys Rev E 79(5):056106","journal-title":"Phys Rev E"},{"key":"4409_CR26","doi-asserted-by":"publisher","DOI":"10.1201\/b15385","volume-title":"Handbook of graph drawing and visualization","author":"R Tamassia","year":"2013","unstructured":"Tamassia R (2013) Handbook of graph drawing and visualization. CRC Press, Boca Raton, US"},{"issue":"14","key":"4409_CR27","doi-asserted-by":"publisher","first-page":"5715","DOI":"10.1007\/s00500-018-3230-x","volume":"23","author":"D Chalupa","year":"2019","unstructured":"Chalupa D, Hawick KA (2019) Graphcombex: a software tool for exploration of combinatorial optimization properties of large graphs. Soft Computi 23(14):5715\u20135724","journal-title":"Soft Computi"},{"issue":"1","key":"4409_CR28","first-page":"1","volume":"38","author":"Y Minjing","year":"2019","unstructured":"Minjing Y, Ye Z, Liu YJ, He Y, Wang CCL (2019) Lineup: computing chain-based physical transformation. ACM Trans Graph (TOG) 38(1):1\u201316","journal-title":"ACM Trans Graph (TOG)"},{"issue":"39","key":"4409_CR29","doi-asserted-by":"publisher","first-page":"5340","DOI":"10.1016\/j.tcs.2011.06.010","volume":"412","author":"WQ Zhang","year":"2011","unstructured":"Zhang WQ, Liu YJ (2011) Approximating the longest paths in grid graphs. Theor Comput Sci 412(39):5340\u20135350","journal-title":"Theor Comput Sci"},{"key":"4409_CR30","doi-asserted-by":"crossref","unstructured":"Rossi RA, Ahmed NK (2015) The Network Data Repository with Interactive Graph Analytics and Visualization. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence AAAI Press, Texas, USA, pp.4292-4293","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"4409_CR31","doi-asserted-by":"crossref","unstructured":"Bastian M, Heymann S, Jacomy M (2009) Gephi: an open source software for exploring and manipulating networks. International AAAI Conference on Weblogs and Social Media. California USA, San Jose, pp 361\u2013362","DOI":"10.1609\/icwsm.v3i1.13937"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04409-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04409-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04409-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T22:40:31Z","timestamp":1675118431000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04409-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,30]]},"references-count":31,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["4409"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04409-3","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2022,3,30]]},"assertion":[{"value":"24 February 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}