{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T22:05:53Z","timestamp":1649196353090},"reference-count":18,"publisher":"Springer Science and Business Media LLC","license":[{"start":{"date-parts":[[2013,9,4]],"date-time":"2013-09-04T00:00:00Z","timestamp":1378252800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"DOI":"10.1007\/s00453-013-9820-1","type":"journal-article","created":{"date-parts":[[2013,9,3]],"date-time":"2013-09-03T15:10:20Z","timestamp":1378221020000},"source":"Crossref","is-referenced-by-count":0,"title":["Computing H-Joins with Application to 2-Modular Decomposition"],"prefix":"10.1007","author":[{"given":"Michel","family":"Habib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Mamcarz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabien","family":"de Montgolfier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,9,4]]},"reference":[{"issue":"3","key":"9820_CR1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B. Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf. Process. Lett. 8(3), 121\u2013123 (1979)","journal-title":"Inf. Process. Lett."},{"issue":"7","key":"9820_CR2","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1016\/j.dam.2009.09.009","volume":"158","author":"B.-M. Bui-Xuan","year":"2010","unstructured":"Bui-Xuan, B.-M., Telle, J.A., Vatshelle, M.: H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Discrete Appl. Math. 158(7), 809\u2013819 (2010)","journal-title":"Discrete Appl. Math."},{"issue":"39","key":"9820_CR3","doi-asserted-by":"crossref","first-page":"5187","DOI":"10.1016\/j.tcs.2011.05.022","volume":"412","author":"B.-M. Bui-Xuan","year":"2011","unstructured":"Bui-Xuan, B.-M., Telle, J.A., Vatshelle, M.: Boolean-width of graphs. Theor. Comput. Sci. 412(39), 5187\u20135204 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"9820_CR4","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.jda.2012.11.003","volume":"17","author":"P. Charbit","year":"2012","unstructured":"Charbit, P., Habib, M., Trotignon, N., Vuskovic, K.: Detecting 2-joins faster. J. Discrete Algorithms 17, 60\u201366 (2012)","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"9820_CR5","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/10080052X","volume":"26","author":"P. Charbit","year":"2012","unstructured":"Charbit, P., de Montgolfier, F., Raffinot, M.: A simple linear time split decomposition algorithm of undirected graphs. SIAM J. Discrete Math. 26(2), 499\u2013514 (2012)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"9820_CR6","doi-asserted-by":"crossref","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."},{"key":"9820_CR7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01788536","volume":"3","author":"V. Chv\u00e1tal","year":"1987","unstructured":"Chv\u00e1tal, V., Sbihi, N.: Bull-free graphs are perfect. Graphs Comb. 3, 127\u2013139 (1987)","journal-title":"Graphs Comb."},{"key":"9820_CR8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1006\/jctb.2000.2010","volume":"81","author":"M. Conforti","year":"2001","unstructured":"Conforti, M., Cornu\u00e9jols, G., Kapoor, A., Vu\u0161kovi\u0107, K.: Balanced 0,\u00b11 matrices, Part I: Decomposition theorem, and Part II: Recognition algorithm. J. Comb. Theory, Ser. B 81, 243\u2013306 (2001)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"3","key":"9820_CR9","doi-asserted-by":"crossref","first-page":"734","DOI":"10.4153\/CJM-1980-057-7","volume":"32","author":"W.H. Cunningham","year":"1980","unstructured":"Cunningham, W.H., Edmonds, J.: A combinatorial decomposition theory. Can. J. Math. 32(3), 734\u2013765 (1980)","journal-title":"Can. J. Math."},{"key":"9820_CR10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0166-218X(95)00090-E","volume":"72","author":"H. Everett","year":"1997","unstructured":"Everett, H., Klein, S., Reed, B.: An algorithm for finding homogeneous pairs. Discrete Appl. Math. 72, 209\u2013218 (1997)","journal-title":"Discrete Appl. Math."},{"key":"9820_CR11","first-page":"870","volume-title":"ACM-SIAM Symposium on Discrete Algorithms","author":"T. Feder","year":"2005","unstructured":"Feder, T., Hell, P., Kr\u00e1l, D., Sgall, J.: Two algorithms for general list matrix partitions. In: ACM-SIAM Symposium on Discrete Algorithms, pp.\u00a0870\u2013876 (2005)"},{"key":"9820_CR12","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1137\/S0895480100384055","volume":"16","author":"T. Feder","year":"2003","unstructured":"Feder, T., Hell, P., Klein, S., Motwani, R.: List partitions. SIAM J. Discrete Math. 16, 61\u201380 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"9820_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/978-3-642-29344-3_38","volume-title":"Latin American Theoretical Informatics","author":"M. Habib","year":"2012","unstructured":"Habib, M., Mamcarz, A., de Montgolfier, F.: Algorithms for some H-join decompositions. In: Latin American Theoretical Informatics. Lecture Notes in Computer Science, vol. 7256, pp.\u00a0446\u2013457 (2012)"},{"key":"9820_CR14","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.cosrev.2010.01.001","volume":"4","author":"M. Habib","year":"2010","unstructured":"Habib, M., Paul, C.: A survey of the algorithmic aspects of modular decomposition. Comput. Sci. Rev. 4, 41\u201359 (2010)","journal-title":"Comput. Sci. Rev."},{"issue":"2","key":"9820_CR15","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1142\/S0129054199000125","volume":"10","author":"M. Habib","year":"1999","unstructured":"Habib, M., Paul, C., Viennot, L.: Partition refinement techniques: an interesting algorithmic toolkit. Int. J. Found. Comput. Sci. 10(2), 147\u2013170 (1999)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9820_CR16","unstructured":"de Montgolfier, F.: D\u00e9composition modulaire des graphes: th\u00e9orie, extensions et algorithmes. Ph.D. thesis, Universit\u00e9 Montpellier II (2003)"},{"key":"9820_CR17","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16, 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"key":"9820_CR18","unstructured":"Rao, M.: D\u00e9compositions de graphes et algorithmes efficaces. Ph.D. thesis, Universit\u00e9 de Metz (2006)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9820-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9820-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9820-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:12Z","timestamp":1559137512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9820-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,4]]},"references-count":18,"alternative-id":["9820"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9820-1","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,4]]}}}