{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:54:02Z","timestamp":1742957642496,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319623887"},{"type":"electronic","value":"9783319623894"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62389-4_29","type":"book-chapter","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T15:07:46Z","timestamp":1498835266000},"page":"346-358","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Strong Triadic Closure in Cographs and Graphs of Low Maximum Degree"],"prefix":"10.1007","author":[{"given":"Athanasios L.","family":"Konstantinidis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stavros D.","family":"Nikolopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charis","family":"Papadopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,1]]},"reference":[{"key":"29_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, 89\u2013113 (2004)","journal-title":"Mach. Learn."},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.tcs.2015.07.001","volume":"600","author":"F Bonomo","year":"2015","unstructured":"Bonomo, F., Dur\u00e1n, G., Valencia-Pabon, M.: Complexity of the cluster deletion problem on subclasses of chordal graphs. Theoret. Comput. Sci. 600, 59\u201369 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.: Graph Classes: A Survey. Society for Industrial and Applied Mathematics (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/s00453-014-9967-4","volume":"74","author":"M Cochefert","year":"2016","unstructured":"Cochefert, M., Couturier, J.-F., Golovach, P.A., Kratsch, D., Paulusma, D.: Parameterized algorithms for finding square roots. Algorithmica 74, 602\u2013629 (2016)","journal-title":"Algorithmica"},{"key":"29_CR5","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., Stewart, L.K.: Complement reducible graphs. Discret. Appl. Math. 3, 163\u2013174 (1981)","journal-title":"Discret. Appl. Math."},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"DG Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Comput. 14, 926\u2013934 (1985)","journal-title":"SIAM J. Comput."},{"key":"29_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Cham (2015)"},{"key":"29_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, Crowds, and Markets: Reasoning About a Highly Connected World","author":"D Easley","year":"2010","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, New York (2010)"},{"key":"29_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Springer, Heidelberg (2010)"},{"key":"29_CR10","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. Discret. Math. 313, 2763\u20132771 (2013)","journal-title":"Discret. Math."},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1086\/225469","volume":"78","author":"M Granovetter","year":"1973","unstructured":"Granovetter, M.: The strength of weak ties. Am. J. Sociol. 78, 1360\u20131380 (1973)","journal-title":"Am. J. Sociol."},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-40164-0_19","volume-title":"Fundamentals of Computation Theory","author":"W-K Hon","year":"2013","unstructured":"Hon, W.-K., Kloks, T., Liu, H.-H., Poon, S.-H., Wang, Y.-L.: On independence domination. In: G\u0105sieniec, L., Wolter, F. (eds.) FCT 2013. LNCS, vol. 8070, pp. 183\u2013194. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-40164-0_19"},{"key":"29_CR13","doi-asserted-by":"crossref","DOI":"10.1201\/b10613","volume-title":"Topics in Graph Theory: Graphs and Their Cartesian Product","author":"W Imrich","year":"2008","unstructured":"Imrich, W., Klavzar, S., Rall, D.F.: Topics in Graph Theory: Graphs and Their Cartesian Product. AK Peters Ltd., Wellesley (2008)"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0893-9659(94)90018-3","volume":"7","author":"PK Jha","year":"1994","unstructured":"Jha, P.K., Slutzki, G.: Independence numbers of product graphs. Appl. Math. Lett. 7, 91\u201394 (1994)","journal-title":"Appl. Math. Lett."},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"2259","DOI":"10.1016\/j.dam.2012.05.019","volume":"160","author":"C Komusiewicz","year":"2012","unstructured":"Komusiewicz, C., Uhlmann, J.: Cluster editing with locally bounded modifications. Discret. Appl. Math. 160, 2259\u20132270 (2012)","journal-title":"Discret. Appl. Math."},{"key":"29_CR16","unstructured":"Konstantinids, A., Papadopoulos, C.: Maximizing the strong triadic closure in split graphs and proper interval graphs. CoRR, abs\/1609.09433 (2016)"},{"key":"29_CR17","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0012-365X(95)00109-A","volume":"159","author":"VB Le","year":"1996","unstructured":"Le, V.B.: Gallai graphs and anti-gallai graphs. SIAM J. Discret. Math. 159, 179\u2013189 (1996)","journal-title":"SIAM J. Discret. Math."},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0166-218X(03)00448-7","volume":"136","author":"R Shamir","year":"2004","unstructured":"Shamir, R., Sharan, R.: A fully dynamic algorithm for modular decomposition and recognition of cographs. Discret. Appl. Math. 136, 329\u2013340 (2004)","journal-title":"Discret. Appl. Math."},{"key":"29_CR19","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. Discret. Appl. Math. 144, 173\u2013182 (2004)","journal-title":"Discret. Appl. Math."},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Sintos, S., Tsaparas, P.: Using strong triadic closure to characterize ties in social networks. In: Proceedings of KDD 2014, pp. 1466\u20131475 (2014)","DOI":"10.1145\/2623330.2623664"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62389-4_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:25:13Z","timestamp":1709810713000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62389-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319623887","9783319623894"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62389-4_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"1 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 August 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon2017.comp.polyu.edu.hk\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}