{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:17:52Z","timestamp":1742962672725,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319123394"},{"type":"electronic","value":"9783319123400"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12340-0_22","type":"book-chapter","created":{"date-parts":[[2014,10,20]],"date-time":"2014-10-20T04:27:23Z","timestamp":1413779243000},"page":"263-274","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs"],"prefix":"10.1007","author":[{"given":"Michel","family":"Habib","sequence":"first","affiliation":[]},{"given":"Antoine","family":"Mamcarz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,21]]},"reference":[{"issue":"5","key":"22_CR1","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1016\/j.ejc.2011.09.032","volume":"33","author":"B-M Bui-Xuan","year":"2012","unstructured":"Bui-Xuan, B.-M., Habib, M., Rao, M.: Tree-representation of set families and applications to combinatorial decompositions. Eur. J. Comb. 33(5), 688\u2013711 (2012)","journal-title":"Eur. J. Comb."},{"issue":"1","key":"22_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0020-0190(98)00076-3","volume":"67","author":"MR Cerioli","year":"1998","unstructured":"Cerioli, M.R., Everett, H., de Figueiredo, C.M.H., Klein, S.: The homogeneous set sandwich problem. IPL 67(1), 31\u201335 (1998)","journal-title":"IPL"},{"issue":"2","key":"22_CR3","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/10080052X","volume":"26","author":"P Charbit","year":"2012","unstructured":"Charbit, P., de Montgolfier, F., Raffinot, M.: Linear time split decomposition revisited. SIAM J. Discrete Math. 26(2), 499\u2013514 (2012)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"22_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0012-365X(81)90138-2","volume":"37","author":"M Chein","year":"1981","unstructured":"Chein, M., Habib, M., Maurer, M.C.: Partitive hypergraphs. Discrete Math. 37(1), 35\u201350 (1981)","journal-title":"Discrete Math."},{"unstructured":"Chudnovsky, M.: Berge trigraphs and their applications. Ph.D. thesis, Princeton University (2003)","key":"22_CR5"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1002\/jgt.20040","volume":"48","author":"M Chudnovsky","year":"2005","unstructured":"Chudnovsky, M.: Berge trigraphs. J. Graph Theory 48, 85\u2013111 (2005)","journal-title":"J. Graph Theory"},{"issue":"1","key":"22_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.jctb.2011.07.003","volume":"102","author":"M Chudnovsky","year":"2012","unstructured":"Chudnovsky, M.: The structure of bull-free graphs i. J. Comb. Theory Ser. B 102(1), 233\u2013251 (2012)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"5","key":"22_CR8","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1016\/j.jctb.2007.06.007","volume":"98","author":"M Chudnovsky","year":"2008","unstructured":"Chudnovsky, M., Seymour, P.: Claw-free graphs. iv. decomposition theorem. J. Comb. Theory, Ser. B 98(5), 839\u2013938 (2008)","journal-title":"J. Comb. Theory, Ser. B"},{"unstructured":"Chudnovsky, M., Trotignon, N., Trunck, T., Vuskovic, K.: Coloring perfect graphs with no balanced skew-partitions. CoRR, abs\/1308.6444 (2013)","key":"22_CR9"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/BFb0017474","volume-title":"Trees in Algebra and Programming - CAAP \u201994","author":"A Cournier","year":"1994","unstructured":"Cournier, A., Habib, M.: A new linear algorithm for modular decomposition. In: Tison, Sophie (ed.) CAAP 1994. LNCS, vol. 787, pp. 68\u201384. Springer, Heidelberg (1994)"},{"issue":"3","key":"22_CR11","doi-asserted-by":"publisher","first-page":"734","DOI":"10.4153\/CJM-1980-057-7","volume":"32","author":"WH Cunningham","year":"1980","unstructured":"Cunningham, W.H., Edmonds, J.: A combinatorial decomposition theory. Canad. J. Math 32(3), 734\u2013765 (1980)","journal-title":"Canad. J. Math"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/3-540-58715-2_123","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"E Dahlhaus","year":"1994","unstructured":"Dahlhaus, E.: Efficient parallel and linear time sequential split decomposition (extended abstract). In: Thiagarajan, P.S. (ed.) FSTTCS 1994. LNCS, vol. 880, pp. 171\u2013180. Springer, Heidelberg (1994)"},{"issue":"2","key":"22_CR13","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1006\/jagm.2000.1090","volume":"36","author":"E Dahlhaus","year":"2000","unstructured":"Dahlhaus, E.: Parallel algorithms for hierarchical clustering and applications to split decomposition and parity graph recognition. J. Algorithms 36(2), 205\u2013240 (2000)","journal-title":"J. Algorithms"},{"unstructured":"de Montgolfier, F.: D\u00e9composition modulaire des graphes: th\u00e9orie, extensions et algorithmes. Ph.D. thesis, Universit\u00e9 Montpellier 2 (2003)","key":"22_CR14"},{"issue":"1\u20132","key":"22_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare graphen. Acta Math. Acad. Scientiarum Hung. 18(1\u20132), 25\u201366 (1967)","journal-title":"Acta Math. Acad. Scientiarum Hung."},{"issue":"2","key":"22_CR16","first-page":"245","volume":"70","author":"M Habib","year":"2014","unstructured":"Habib, M., Mamcarz, A., Montgolfier, F.: Computing h-joins with application to 2-modular decomposition. Algorithmica 70(2), 245\u2013266 (2014)","journal-title":"Algorithmica"},{"unstructured":"Mamcarz, A.: Some applications of vertex splitting for graph algorithms. Ph.D. thesis, University of Paris 7 (2014)","key":"22_CR17"},{"issue":"1\u20133","key":"22_CR18","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"RM McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discrete Math. 201(1\u20133), 189\u2013241 (1999)","journal-title":"Discrete Math."},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/978-3-540-70575-8_52","volume-title":"Automata, Languages and Programming","author":"M Tedder","year":"2008","unstructured":"Tedder, M., Corneil, D.G., Habib, M., Paul, C.: Simpler linear-time modular decomposition via recursive factorizing permutations. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 634\u2013645. Springer, Heidelberg (2008)"},{"unstructured":"Thomass\u00e9, S., Trotignon, N., Vuskovic, K.: Parameterized algorithm for weighted independent set problem in bull-free graphs. CoRR, abs\/1310.6205 (2013)","key":"22_CR20"},{"unstructured":"Trotignon, N., Vu\u0161kovi\u0107, K.: A structure theorem for graphs with no cycle with a unique chord and its consequences. ArXiv e-prints, September 2013","key":"22_CR21"},{"unstructured":"Trotignon, N.: Complexity of some trigraph problems. Private communication, 2013","key":"22_CR22"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12340-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T14:50:28Z","timestamp":1676904628000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12340-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319123394","9783319123400"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12340-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"21 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}