{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T10:18:50Z","timestamp":1768472330320,"version":"3.49.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T00:00:00Z","timestamp":1701302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T00:00:00Z","timestamp":1701302400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s11390-023-1420-1","type":"journal-article","created":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T13:02:41Z","timestamp":1706706161000},"page":"1431-1439","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["2k-Vertex Kernels for Cluster Deletion and Strong Triadic Closure"],"prefix":"10.1007","volume":"38","author":[{"given":"Wen-Yu","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hang","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,30]]},"reference":[{"key":"1420_CR1","doi-asserted-by":"publisher","unstructured":"Sintos S, Tsaparas P. Using strong triadic closure to characterize ties in social networks. In Proc. the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Aug. 2014, pp.1466\u20131475. https:\/\/doi.org\/10.1145\/2623330.2623664.","DOI":"10.1145\/2623330.2623664"},{"issue":"6","key":"1420_CR2","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1086\/225469","volume":"78","author":"MS Granovetter","year":"1973","unstructured":"Granovetter M S. The strength of weak ties. American Journal of Sociology, 1973, 78(6): 1360\u20131380. https:\/\/doi.org\/10.1086\/225469.","journal-title":"American Journal of Sociology"},{"issue":"7","key":"1420_CR3","doi-asserted-by":"publisher","first-page":"2006","DOI":"10.1007\/s00453-020-00684-9","volume":"82","author":"PA Golovach","year":"2020","unstructured":"Golovach P A, Heggernes P, Konstantinidis A L, Lima P T, Papadopoulos C. Parameterized aspects of strong subgraph closure. Algorithmica, 2020, 82(7): 2006\u20132038. https:\/\/doi.org\/10.1007\/s00453-020-00684-9.","journal-title":"Algorithmica"},{"issue":"4","key":"1420_CR4","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s00453-019-00617-1","volume":"82","author":"N Gr\u00fcttemeier","year":"2020","unstructured":"Gr\u00fcttemeier N, Komusiewicz C. On the relation of strong triadic closure and cluster deletion. Algorithmica, 2020, 82(4): 853\u2013880. https:\/\/doi.org\/10.1007\/s00453-019-00617-1.","journal-title":"Algorithmica"},{"key":"1420_CR5","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2018.05.012","volume":"740","author":"AL Konstantinidis","year":"2018","unstructured":"Konstantinidis A L, Nikolopoulos S D, Papadopoulos C. Strong triadic closure in cographs and graphs of low maximum degree. Theoretical Computer Science, 2018, 740: 76\u201384. https:\/\/doi.org\/10.1016\/j.tcs.2018.05.012.","journal-title":"Theoretical Computer Science"},{"issue":"8\/9\/10","key":"1420_CR6","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.tcs.2008.10.021","volume":"410","author":"J Guo","year":"2009","unstructured":"Guo J. A more effective linear kernelization for cluster editing. Theoretical Computer Science, 2009, 410(8\/9\/10): 718\u2013726. https:\/\/doi.org\/10.1016\/j.tcs.2008.10.021.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"1420_CR7","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.jcss.2011.04.001","volume":"78","author":"JE Chen","year":"2012","unstructured":"Chen J E, Meng J. A 2k kernel for the cluster editing problem. Journal of Computer and System Sciences, 2012, 78(1): 211\u2013220. https:\/\/doi.org\/10.1016\/j.jcss.2011.04.001.","journal-title":"Journal of Computer and System Sciences"},{"key":"1420_CR8","doi-asserted-by":"publisher","unstructured":"Berkhin P. A survey of clustering data mining techniques. In Grouping Multidimensional Data: Recent Advances in Clustering, Kogan J, Nicholas C, Teboulle M (eds.), Springer, 2006, pp.25\u201371. https:\/\/doi.org\/10.1007\/3-540-28349-8_2.","DOI":"10.1007\/3-540-28349-8_2"},{"issue":"1\/2\/3","key":"1420_CR9","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N Bansal","year":"2004","unstructured":"Bansal N, Blum A, Chawla S. Correlation clustering. Machine Learning, 2004, 56(1\/2\/3): 89\u2013113. https:\/\/doi.org\/10.1023\/B:MACH.0000033116.57574.95.","journal-title":"Machine Learning"},{"issue":"4","key":"1420_CR10","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539701389154","volume":"32","author":"ZZ Chen","year":"2003","unstructured":"Chen Z Z, Jiang T, Lin G H. Computing phylogenetic roots with bounded degrees and errors. SIAM Journal on Computing, 2003, 32(4): 864\u2013879. https:\/\/doi.org\/10.1137\/S0097539701389154.","journal-title":"SIAM Journal on Computing"},{"issue":"1\/2","key":"1420_CR11","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.dam.2004.01.007","volume":"144","author":"R Shamir","year":"2004","unstructured":"Shamir R, Sharan R, Tsur D. Cluster graph modification problems. Discrete Applied Mathematics, 2004, 144(1\/2): 173\u2013182. https:\/\/doi.org\/10.1016\/j.dam.2004.01.007.","journal-title":"Discrete Applied Mathematics"},{"issue":"23","key":"1420_CR12","doi-asserted-by":"publisher","first-page":"2763","DOI":"10.1016\/j.disc.2013.08.017","volume":"313","author":"Y Gao","year":"2013","unstructured":"Gao Y, Hare D R, Nastos J. The cluster deletion problem for cographs. Discrete Mathematics, 2013, 313(23): 2763\u20132771. https:\/\/doi.org\/10.1016\/j.disc.2013.08.017.","journal-title":"Discrete Mathematics"},{"issue":"3\/4","key":"1420_CR13","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1089\/106652799318274","volume":"6","author":"A Ben-Dor","year":"1999","unstructured":"Ben-Dor A, Shamir R, Yakhini Z. Clustering gene expression patterns. Journal of Computational Biology, 1999, 6(3\/4): 281\u2013297. https:\/\/doi.org\/10.1089\/106652799318274.","journal-title":"Journal of Computational Biology"},{"key":"1420_CR14","doi-asserted-by":"publisher","unstructured":"Fellows M R. The lost continent of polynomial time: Preprocessing and kernelization. In Proc. the 2nd International Workshop on Parameterized and Exact Computation, Sept. 2006, pp.276\u2013277. https:\/\/doi.org\/10.1007\/11847250_25.","DOI":"10.1007\/11847250_25"},{"key":"1420_CR15","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.dam.2020.05.035","volume":"285","author":"AL Konstantinidis","year":"2020","unstructured":"Konstantinidis A L, Papadopoulos C. Maximizing the strong triadic closure in split graphs and proper interval graphs. Discrete Applied Mathematics, 2020, 285: 79\u201395. https:\/\/doi.org\/10.1016\/j.dam.2020.05.035.","journal-title":"Discrete Applied Mathematics"},{"key":"1420_CR16","doi-asserted-by":"publisher","unstructured":"Hsu W L, Ma T H. Substitution decomposition on chordal graphs and applications. In Proc. the 2nd International Symposium on Algorithms, Dec. 1991, pp.52\u201360. https:\/\/doi.org\/10.1007\/3-540-54945-5_49.","DOI":"10.1007\/3-540-54945-5_49"},{"key":"1420_CR17","doi-asserted-by":"publisher","unstructured":"Niedermeier R. Invitation to Fixed-Parameter Algorithms. Oxford University Press, 2006. https:\/\/doi.org\/10.1093\/acprof:oso\/9780198566076.001.0001.","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"1420_CR18","doi-asserted-by":"publisher","unstructured":"Cygan M, Fomin F V, Kowalik \u0141, Lokshtanov D, Marx D, Pilipczuk M, Pilipczuk M, Saurabh S. Parameterized Algorithms. Springer, 2015. https:\/\/doi.org\/10.1007\/978-3-319-21275-3.","DOI":"10.1007\/978-3-319-21275-3"},{"issue":"1","key":"1420_CR19","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00224-007-9032-7","volume":"44","author":"F Protti","year":"2009","unstructured":"Protti F, Da Silva M D, Szwarcfiter J L. Applying modular decomposition to parameterized cluster editing problems. Theory of Computing Systems, 2009, 44(1): 91\u2013104. https:\/\/doi.org\/10.1007\/s00224-007-9032-7.","journal-title":"Theory of Computing Systems"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-023-1420-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11390-023-1420-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-023-1420-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T13:22:14Z","timestamp":1706707334000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11390-023-1420-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,30]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1420"],"URL":"https:\/\/doi.org\/10.1007\/s11390-023-1420-1","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,30]]},"assertion":[{"value":"4 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}