{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:26:43Z","timestamp":1775068003311,"version":"3.50.1"},"reference-count":22,"publisher":"Informa UK Limited","issue":"1-2","funder":[{"DOI":"10.13039\/501100004410","name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ft\u0131rma Kurumu","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Computer Mathematics: Computer Systems Theory"],"published-print":{"date-parts":[[2025,4,3]]},"DOI":"10.1080\/23799927.2025.2492616","type":"journal-article","created":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T08:05:54Z","timestamp":1744272354000},"page":"44-57","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":1,"title":["Code optimization of contraction operation in agglomeration-based node importance analysis"],"prefix":"10.1080","volume":"10","author":[{"given":"Zeynep Nihan","family":"Berberler","sequence":"first","affiliation":[{"name":"Dokuz Eylul University","place":["Izmir, Turkey"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Halil \u0130brahim","family":"Y\u0131ld\u0131r\u0131m","sequence":"additional","affiliation":[{"name":"Dokuz Eylul University","place":["Izmir, Turkey"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0130zzet","family":"Tun\u00e7","sequence":"additional","affiliation":[{"name":"Dokuz Eylul University","place":["Izmir, Turkey"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tolga","family":"\u0130lt\u00fczer","sequence":"additional","affiliation":[{"name":"Dokuz Eylul University","place":["Izmir, Turkey"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2025,4,17]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00175-7"},{"key":"e_1_3_3_3_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"e_1_3_3_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2005.10.009"},{"issue":"12","key":"e_1_3_3_5_1","first-page":"29","article-title":"Skeleton-network reconfiguration based on node importance and line betweenness","volume":"34","author":"Wang L.","year":"2010","unstructured":"L. Wang, Y. Liu, X. Gu, Y. Wang, and J. Jia, Skeleton-network reconfiguration based on node importance and line betweenness. Autom. Electr. Power Syst. 34(12) (2010), pp. 29\u201333.","journal-title":"Autom. Electr. Power Syst."},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.82.026116"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms7868"},{"key":"e_1_3_3_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.09.046"},{"key":"e_1_3_3_9_1","doi-asserted-by":"publisher","DOI":"10.1038\/srep19307"},{"issue":"17","key":"e_1_3_3_10_1","first-page":"1","article-title":"Node importance ranking of complex networks","volume":"62","author":"Liu J.G.","year":"2013","unstructured":"J.G. Liu, Z.M. Ren, Q. Guo, and B.H. Wang, Node importance ranking of complex networks. Acta Phys. Sinica-Chinese Edn. 62(17) (2013), pp. 1\u201310.","journal-title":"Acta Phys. Sinica-Chinese Edn."},{"key":"e_1_3_3_11_1","doi-asserted-by":"publisher","DOI":"10.1038\/srep08665"},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/703625"},{"issue":"11","key":"e_1_3_3_13_1","first-page":"79","article-title":"Evaluation method for node importance based on node contraction in complex networks","volume":"26","author":"Yue-jin T.","year":"2006","unstructured":"T. Yue-jin, W. Jun, and D. Hong-zhong, Evaluation method for node importance based on node contraction in complex networks. Syst. Eng. Theory Pract. 26(11) (2006), pp. 79\u201383.","journal-title":"Syst. Eng. Theory Pract."},{"key":"e_1_3_3_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.proeng.2011.08.298"},{"key":"e_1_3_3_15_1","volume-title":"Introduction to Algorithms","author":"Leiserson C.E.","year":"2001","unstructured":"C.E. Leiserson, T.H. Cormen, R.L. Rivest, and C. Stein, Introduction to Algorithms, The MIT Press, Massachusetts, A.B.D., 2001."},{"key":"e_1_3_3_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368166"},{"key":"e_1_3_3_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0205006"},{"key":"e_1_3_3_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90200-F"},{"key":"e_1_3_3_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.08.008"},{"key":"e_1_3_3_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9062-1"},{"key":"e_1_3_3_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9063-0"},{"key":"e_1_3_3_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-005-1199-1"},{"key":"e_1_3_3_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.02.001"}],"container-title":["International Journal of Computer Mathematics: Computer Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/23799927.2025.2492616","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T04:13:16Z","timestamp":1752120796000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/23799927.2025.2492616"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,3]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,4,3]]}},"alternative-id":["10.1080\/23799927.2025.2492616"],"URL":"https:\/\/doi.org\/10.1080\/23799927.2025.2492616","relation":{},"ISSN":["2379-9927","2379-9935"],"issn-type":[{"value":"2379-9927","type":"print"},{"value":"2379-9935","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,3]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tcom20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tcom20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2023-04-27","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-05-16","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-04-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-04-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}