{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T19:10:52Z","timestamp":1782760252487,"version":"3.54.5"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,5,9]],"date-time":"2020-05-09T00:00:00Z","timestamp":1588982400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,9]],"date-time":"2020-05-09T00:00:00Z","timestamp":1588982400000},"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":["Evol. Intel."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s12065-020-00416-6","type":"journal-article","created":{"date-parts":[[2020,5,9]],"date-time":"2020-05-09T15:03:51Z","timestamp":1589036631000},"page":"2411-2420","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A simple detection and generation algorithm for simple circuits in directed graph based on depth-first traversal"],"prefix":"10.1007","volume":"15","author":[{"given":"Xiaoyan","family":"Gongye","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yutian","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yulian","family":"Wen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peiyao","family":"Nie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peiguang","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,5,9]]},"reference":[{"key":"416_CR1","first-page":"1736","volume-title":"Graph theory","author":"N Biggs","year":"1986","unstructured":"Biggs N, Lloyd E, Wilson R (1986) Graph theory. Oxford University Press, Oxford, pp 1736\u20131936"},{"issue":"4","key":"416_CR2","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/s12239-015-0067-5","volume":"16","author":"K Chu","year":"2015","unstructured":"Chu K et al (2015) Real-time path planning of autonomous vehicles for unstructured road navigation. Int J Automot Technol 16(4):653\u2013668","journal-title":"Int J Automot Technol"},{"issue":"6","key":"416_CR3","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1142\/S0129054115500379","volume":"26","author":"A Aytac","year":"2015","unstructured":"Aytac A, Turaci T (2015) Vulnerability measures of transformation graph G(xy)+. Int J Found Comput Sci 26(6):667\u2013675","journal-title":"Int J Found Comput Sci"},{"issue":"26","key":"416_CR4","doi-asserted-by":"publisher","first-page":"14702","DOI":"10.1021\/jp5129782","volume":"119","author":"A Marsden","year":"2015","unstructured":"Marsden A, Berry RS (2015) Enrichment of network diagrams for potential surfaces. J Phys Chem C 119(26):14702\u201314705","journal-title":"J Phys Chem C"},{"issue":"03","key":"416_CR5","first-page":"72","volume":"21","author":"M Tang","year":"2012","unstructured":"Tang M, Guan J, Deng GQ et al (2012) A new algorithm and application of solving maximum matching problem of bipartite graph. Comput Syst Appl 21(03):72\u201375","journal-title":"Comput Syst Appl"},{"issue":"1\u20132","key":"416_CR6","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10479-017-2560-x","volume":"261","author":"NEH Tellache","year":"2018","unstructured":"Tellache NEH, Boudhar M (2018) Flow shop scheduling problem with conflict graphs. Ann Oper Res 261(1\u20132):339\u2013363","journal-title":"Ann Oper Res"},{"issue":"6","key":"416_CR7","doi-asserted-by":"publisher","first-page":"1720","DOI":"10.1080\/00207543.2016.1224950","volume":"55","author":"A Kouider","year":"2017","unstructured":"Kouider A et al (2017) Mixed graph colouring for unit-time scheduling. Int J Prod Res 55(6):1720\u20131729","journal-title":"Int J Prod Res"},{"key":"416_CR8","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.ins.2016.01.057","volume":"345","author":"F Wang","year":"2016","unstructured":"Wang F, Xing KY, Zhou MC, Xu XP, Han LB (2016) A robust deadlock prevention control for automated manufacturing systems with unreliable resources. Inf Sci 345:243\u2013256","journal-title":"Inf Sci"},{"issue":"1\u20132","key":"416_CR9","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10479-017-2666-1","volume":"264","author":"CVGC Lima","year":"2018","unstructured":"Lima CVGC et al (2018) And\/or-convexity: a graph convexity based on processes and deadlock models. Ann Oper Res 264(1\u20132):267\u2013286","journal-title":"Ann Oper Res"},{"issue":"10","key":"416_CR10","doi-asserted-by":"publisher","first-page":"2294","DOI":"10.1109\/TNNLS.2016.2582746","volume":"28","author":"X Chang","year":"2017","unstructured":"Chang X, Yang Y (2017) Semisupervised feature analysis by mining correlations among multiple tasks. IEEE Trans Neural Netw Learn Syst 28(10):2294\u20132305","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"5","key":"416_CR11","doi-asserted-by":"publisher","first-page":"1180","DOI":"10.1109\/TCYB.2016.2539546","volume":"47","author":"X Chang","year":"2017","unstructured":"Chang X et al (2017) Bi-level semantic representation analysis for multimedia event detection. IEEE Trans Cybern 47(5):1180\u20131197","journal-title":"IEEE Trans Cybern"},{"issue":"10","key":"416_CR12","doi-asserted-by":"publisher","first-page":"2100","DOI":"10.1109\/TKDE.2017.2728531","volume":"29","author":"Z Li","year":"2017","unstructured":"Li Z et al (2017) Beyond trace ratio: weighted harmonic mean of trace ratios for multiclass discriminant analysis. IEEE Trans Knowl Data Eng 29(10):2100\u20132110","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"416_CR13","first-page":"2","volume-title":"Graph theory and its engineering applications","author":"WK Chen","year":"2015","unstructured":"Chen WK (2015) Graph theory and its engineering applications. World Scientific Publishing, Singapore, pp 2\u201310"},{"key":"416_CR14","first-page":"2","volume-title":"Graph theory and its applications","author":"YH Bu","year":"2015","unstructured":"Bu YH, Wang WF, Lv XZ (2015) Graph theory and its applications. Southeast University Press, Nanjing, pp 2\u20133"},{"key":"416_CR15","first-page":"144","volume-title":"Data structures in C++","author":"HM Wang","year":"2017","unstructured":"Wang HM, Hu M, Wang T (2017) Data structures in C++. Tsinghua University Press, Beijing, pp 144\u2013145"},{"key":"416_CR16","first-page":"283","volume-title":"Data structures and algorithm analysis in C","author":"AW Mark","year":"2017","unstructured":"Mark AW (2017) Data structures and algorithm analysis in C, 2nd edn. Addison Wesley, Boston, pp 283\u2013284","edition":"2"},{"issue":"2","key":"416_CR17","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.ipl.2014.09.031","volume":"115","author":"C Pang","year":"2015","unstructured":"Pang C et al (2015) Topological sorts on DAGs. Inf Process Lett 115(2):298\u2013301","journal-title":"Inf Process Lett"},{"key":"416_CR18","first-page":"124","volume":"24","author":"JH Qi","year":"2014","unstructured":"Qi JH, Zhu XJ, Zhang ZB (2014) Study on circuits determination algorithm in directed graph. Comput Program Skills Maint 24:124\u2013125","journal-title":"Comput Program Skills Maint"},{"issue":"6","key":"416_CR19","first-page":"481","volume":"9","author":"DY Xiong","year":"1987","unstructured":"Xiong DY (1987) An efficient vector space algorithm of generating all elementary circuits in directed graph. J Electron 9(6):481\u2013489","journal-title":"J Electron"},{"issue":"4","key":"416_CR20","first-page":"12","volume":"36","author":"YY Wang","year":"2008","unstructured":"Wang YY, Chen P, Su Y (2008) A new algorithm to find all elementary circuits of a directed graph. J Shaanxi Norm Univ (Nat Sci Ed) 36(4):12\u201315","journal-title":"J Shaanxi Norm Univ (Nat Sci Ed)"},{"issue":"12","key":"416_CR21","first-page":"27","volume":"26","author":"YY Wang","year":"2009","unstructured":"Wang YY, Chen P, Su Y (2009) An efficient algorithm of generating all elementary circuits in directed graph. Comput Appl Softw 26(12):27\u201329","journal-title":"Comput Appl Softw"},{"issue":"2","key":"416_CR22","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10559-015-9715-z","volume":"51","author":"AV Stepkin","year":"2015","unstructured":"Stepkin AV (2015) Using a collective of agents for exploration of undirected graphs. Cybern Syst Anal 51(2):223\u2013233","journal-title":"Cybern Syst Anal"},{"issue":"1","key":"416_CR23","first-page":"5","volume":"26","author":"B Xu","year":"2002","unstructured":"Xu B, Jia RA (2002) Matrix calculation of directed cycles and relative properties of digraph. J Nanchang Univ (Nat Sci) 26(1):5\u201311","journal-title":"J Nanchang Univ (Nat Sci)"},{"issue":"3","key":"416_CR24","first-page":"584","volume":"40","author":"HG Yang","year":"2017","unstructured":"Yang HG, Shen DR, Kou Y, Nie TZ, Yu G (2017) Strongly connected components based efficient PPR algorithms. Chin J Comput 40(3):584\u2013600","journal-title":"Chin J Comput"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-020-00416-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-020-00416-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-020-00416-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,27]],"date-time":"2022-10-27T20:36:19Z","timestamp":1666902979000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-020-00416-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,9]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["416"],"URL":"https:\/\/doi.org\/10.1007\/s12065-020-00416-6","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,9]]},"assertion":[{"value":"14 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}