{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:40:39Z","timestamp":1742913639132,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031215339"},{"type":"electronic","value":"9783031215346"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T00:00:00Z","timestamp":1674000000000},"content-version":"vor","delay-in-days":382,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider the problem of transforming a given graph into a quasi-threshold graph using a minimum number of edge additions and deletions. Building on the previously proposed heuristic Quasi-Threshold Mover\u00a0(QTM), we present improvements both in terms of running time and quality. We propose a novel, linear-time algorithm that solves the inclusion-minimal variant of this problem, i.e., a set of edge edits such that no subset of them also transforms the given graph into a quasi-threshold graph. In an extensive experimental evaluation, we apply these algorithms to a large set of graphs from different applications and find that they lead QTM to find solutions with fewer edits. Although the inclusion-minimal algorithm needs significantly more edits on its own, it outperforms the initialization heuristic previously proposed for QTM.<\/jats:p>","DOI":"10.1007\/978-3-031-21534-6_7","type":"book-chapter","created":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T20:02:53Z","timestamp":1673985773000},"page":"134-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Skeleton-Based Clustering by\u00a0Quasi-Threshold Editing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1520-0430","authenticated-orcid":false,"given":"Ulrik","family":"Brandes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6958-4927","authenticated-orcid":false,"given":"Michael","family":"Hamann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luise","family":"H\u00e4user","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9141-7076","authenticated-orcid":false,"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,18]]},"reference":[{"issue":"1\u20133","key":"7_CR1","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. Mach. Learn. 56(1\u20133), 89\u2013113 (2004). https:\/\/doi.org\/10.1023\/B:MACH.0000033116.57574.95","journal-title":"Mach. Learn."},{"unstructured":"B\u00f6cker, S., Briesemeister, S., Bui, Q.B.A., Tru\u00df, A.: A fixed-parameter approach for weighted cluster editing. In: APBC, pp. 211\u2013220. Imperial College Press (2008). http:\/\/www.comp.nus.edu.sg\/%7Ewongls\/psZ\/apbc2008\/apbc050a.pdf","key":"7_CR2"},{"issue":"4","key":"7_CR3","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0378-8733(99)00019-2","volume":"21","author":"SP Borgatti","year":"2000","unstructured":"Borgatti, S.P., Everett, M.G.: Models of core\/periphery structures. Soc. Netw. 21(4), 375\u2013395 (2000). https:\/\/doi.org\/10.1016\/S0378-8733(99)00019-2","journal-title":"Soc. Netw."},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-662-48350-3_22","volume-title":"Algorithms - ESA 2015","author":"U Brandes","year":"2015","unstructured":"Brandes, U., Hamann, M., Strasser, B., Wagner, D.: Fast quasi-threshold editing. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 251\u2013262. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_22"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-319-48749-6_13","volume-title":"Combinatorial Optimization and Applications","author":"U Brandes","year":"2016","unstructured":"Brandes, U., Holm, E., Karrenbauer, A.: Cliques in regular graphs and the core-periphery problem in social networks. In: Chan, T.-H.H., Li, M., Wang, L. (eds.) COCOA 2016. LNCS, vol. 10043, pp. 175\u2013186. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48749-6_13"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1186\/s13015-015-0043-7","volume":"10","author":"S Bruckner","year":"2015","unstructured":"Bruckner, S., H\u00fcffner, F., Komusiewicz, C.: A graph modification approach for finding core-periphery structures in protein interaction networks. Algorithms Mol. Biol. 10, 16 (2015). https:\/\/doi.org\/10.1186\/s13015-015-0043-7","journal-title":"Algorithms Mol. Biol."},{"issue":"4","key":"7_CR7","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett. 58(4), 171\u2013176 (1996). https:\/\/doi.org\/10.1016\/0020-0190(96)00050-6","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.ipl.2007.12.009","volume":"107","author":"FPM Chu","year":"2008","unstructured":"Chu, F.P.M.: A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements. Inf. Process. Lett. 107(1), 7\u201312 (2008). https:\/\/doi.org\/10.1016\/j.ipl.2007.12.009","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"DG Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Burlingham, L.S.: Complement reducible graphs. Discret. Appl. Math. 3(3), 163\u2013174 (1981). https:\/\/doi.org\/10.1016\/0166-218X(81)90013-5","journal-title":"Discret. Appl. Math."},{"issue":"9","key":"7_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.3390\/a12090189","volume":"12","author":"N Creignou","year":"2019","unstructured":"Creignou, N., Ktari, R., Meier, A., M\u00fcller, J., Olive, F., Vollmer, H.: Parameterised enumeration for modification problems. Algorithms 12(9), 189 (2019). https:\/\/doi.org\/10.3390\/a12090189","journal-title":"Algorithms"},{"unstructured":"Crespelle, C.: Linear-time minimal cograph editing (2019). https:\/\/perso.ens-lyon.fr\/christophe.crespelle\/publications\/SUB_minimal-cograph-editing.pdf","key":"7_CR11"},{"issue":"2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002). https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math. Program."},{"unstructured":"van Dongen, S.M.: Graph Clustering by Flow Simulation. Ph.D. thesis, University of Utrecht (2000)","key":"7_CR13"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-662-48350-3_35","volume-title":"Algorithms - ESA 2015","author":"PG Drange","year":"2015","unstructured":"Drange, P.G., Dregi, M.S., Lokshtanov, D., Sullivan, B.D.: On the threshold of intractability. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 411\u2013423. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_35"},{"issue":"12","key":"7_CR15","doi-asserted-by":"publisher","first-page":"3481","DOI":"10.1007\/s00453-017-0401-6","volume":"80","author":"PG Drange","year":"2017","unstructured":"Drange, P.G., Pilipczuk, M.: A polynomial kernel for trivially perfect editing. Algorithmica 80(12), 3481\u20133524 (2017). https:\/\/doi.org\/10.1007\/s00453-017-0401-6","journal-title":"Algorithmica"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0167-5060(08)70334-0","volume":"2","author":"S Foldes","year":"1978","unstructured":"Foldes, S., Hammer, P.L.: The Dilworth number of a graph. Ann. Discrete Math. 2, 211\u2013219 (1978). https:\/\/doi.org\/10.1016\/S0167-5060(08)70334-0","journal-title":"Ann. Discrete Math."},{"issue":"3\u20135","key":"7_CR17","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3\u20135), 75\u2013174 (2010). https:\/\/doi.org\/10.1016\/j.physrep.2009.11.002","journal-title":"Phys. Rep."},{"doi-asserted-by":"publisher","unstructured":"Gottesb\u00fcren, L., Hamann, M., Schoch, P., Strasser, B., Wagner, D., Z\u00fchlsdorf, S.: Engineering exact quasi-threshold editing. In: SEA, pp. 10:1\u201310:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.SEA.2020.10","key":"7_CR18","DOI":"10.4230\/LIPIcs.SEA.2020.10"},{"issue":"3","key":"7_CR19","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF02579333","volume":"1","author":"PL Hammer","year":"1981","unstructured":"Hammer, P.L., Simeone, B.: The splittance of a graph. Combinatorica 1(3), 275\u2013284 (1981). https:\/\/doi.org\/10.1007\/BF02579333","journal-title":"Combinatorica"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.tcs.2011.11.040","volume":"461","author":"Y Liu","year":"2012","unstructured":"Liu, Y., Wang, J., Guo, J., Chen, J.: Complexity and parameterized algorithms for cograph editing. Theor. Comput. Sci. 461, 45\u201354 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2011.11.040","journal-title":"Theor. Comput. Sci."},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.tcs.2015.01.049","volume":"573","author":"Y Liu","year":"2015","unstructured":"Liu, Y., Wang, J., You, J., Chen, J., Cao, Y.: Edge deletion problems: branching facilitated by modular decomposition. Theor. Comput. Sci. 573, 63\u201370 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.01.049","journal-title":"Theor. Comput. Sci."},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02289146","volume":"14","author":"RD Luce","year":"1949","unstructured":"Luce, R.D., Perry, A.: A method of matrix analysis of group structure. Psychometrika 14, 95\u2013116 (1949). https:\/\/doi.org\/10.1007\/BF02289146","journal-title":"Psychometrika"},{"unstructured":"Mahadev, N.V., Peled, U.N.: Threshold Graphs and Related Topics. Ann. Discrete Math. 56. Elsevier (1995)","key":"7_CR23"},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2019.04.001","volume":"813","author":"MS Mariani","year":"2019","unstructured":"Mariani, M.S., Ren, Z.M., Bascompte, J., Tessone, C.J.: Nestedness in complex networks: observation, emergence, and implications. Phys. Rep. 813, 1\u201390 (2019). https:\/\/doi.org\/10.1016\/j.physrep.2019.04.001","journal-title":"Phys. Rep."},{"issue":"3","key":"7_CR25","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.socnet.2013.05.001","volume":"35","author":"J Nastos","year":"2013","unstructured":"Nastos, J., Gao, Y.: Familial groups in social networks. Soc. Netw. 35(3), 439\u2013450 (2013). https:\/\/doi.org\/10.1016\/j.socnet.2013.05.001","journal-title":"Soc. Netw."},{"issue":"1","key":"7_CR26","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/0022-0000(81)90022-2","volume":"22","author":"T Ohtsuki","year":"1981","unstructured":"Ohtsuki, T., Mori, H., Kashiwabara, T., Fujisawa, T.: On minimal augmentation of a graph to obtain an interval graph. J. Comput. Syst. Sci. 22(1), 60\u201397 (1981). https:\/\/doi.org\/10.1016\/0022-0000(81)90022-2","journal-title":"J. Comput. Syst. Sci."},{"doi-asserted-by":"publisher","unstructured":"Rahmann, S., Wittkop, T., Baumbach, J., Martin, M., Tru\u00df, A., B\u00f6cker, S.: Exact and Heuristic Algorithms for Weighted Cluster Editing. In: CSB, pp. 391\u2013401 (2007). https:\/\/doi.org\/10.1142\/9781860948732_0040","key":"7_CR27","DOI":"10.1142\/9781860948732_0040"},{"issue":"1","key":"7_CR28","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer, S.E.: Graph clustering. Comput. Sci. Rev. 1(1), 27\u201364 (2007). https:\/\/doi.org\/10.1016\/j.cosrev.2007.05.001","journal-title":"Comput. Sci. Rev."},{"unstructured":"Schmitt, D.: Engineering Heuristic Quasi-Threshold Editing. Master\u2019s thesis, Karlsruhe Institute of Technology (2021). https:\/\/i11www.iti.kit.edu\/_media\/teaching\/theses\/ma-schmitt-21.pdf","key":"7_CR29"},{"issue":"6","key":"7_CR30","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1017\/S0956792516000401","volume":"27","author":"D Schoch","year":"2016","unstructured":"Schoch, D., Brandes, U.: Re-conceptualizing centrality in social networks. Eur. J. Appl. Math. 27(6), 971\u2013985 (2016). https:\/\/doi.org\/10.1017\/S0956792516000401","journal-title":"Eur. J. Appl. Math."},{"issue":"4","key":"7_CR31","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1017\/nws.2016.20","volume":"4","author":"CL Staudt","year":"2016","unstructured":"Staudt, C.L., Sazonovs, A., Meyerhenke, H.: Networkit: a tool suite for large-scale complex network analysis. Netw. Sci. 4(4), 508\u2013530 (2016). https:\/\/doi.org\/10.1017\/nws.2016.20","journal-title":"Netw. Sci."},{"issue":"16","key":"7_CR32","doi-asserted-by":"publisher","first-page":"4165","DOI":"10.1016\/j.physa.2011.12.021","volume":"391","author":"AL Traud","year":"2012","unstructured":"Traud, A.L., Mucha, P.J., Porter, M.A.: Social structure of Facebook networks. Phys. A: Stat. Mech. Appl. 391(16), 4165\u20134180 (2012). https:\/\/doi.org\/10.1016\/j.physa.2011.12.021","journal-title":"Phys. A: Stat. Mech. Appl."},{"issue":"1","key":"7_CR33","doi-asserted-by":"publisher","first-page":"17","DOI":"10.2307\/2033992","volume":"16","author":"ES Wolk","year":"1965","unstructured":"Wolk, E.S.: A note on \u201cThe comparability graph of a tree\". Proc. AMS 16(1), 17\u201320 (1965). https:\/\/doi.org\/10.2307\/2033992","journal-title":"Proc. AMS"},{"issue":"3","key":"7_CR34","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0166-218X(96)00094-7","volume":"69","author":"J Yan","year":"1996","unstructured":"Yan, J., Chen, J., Chang, G.J.: Quasi-threshold graphs. Discret. Appl. Math. 69(3), 247\u2013255 (1996). https:\/\/doi.org\/10.1016\/0166-218X(96)00094-7","journal-title":"Discret. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms for Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21534-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T20:03:37Z","timestamp":1673985817000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21534-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031215339","9783031215346"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21534-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"18 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}