{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:17:09Z","timestamp":1742951829785,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030392185"},{"type":"electronic","value":"9783030392192"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-39219-2_5","type":"book-chapter","created":{"date-parts":[[2020,1,24]],"date-time":"2020-01-24T19:09:24Z","timestamp":1579892964000},"page":"53-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximating Modular Decomposition Is Hard"],"prefix":"10.1007","author":[{"given":"Michel","family":"Habib","sequence":"first","affiliation":[]},{"given":"Lalla","family":"Mouatadid","sequence":"additional","affiliation":[]},{"given":"Mengchuan","family":"Zou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,24]]},"reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/jgt.20390","volume":"62","author":"P Bonsma","year":"2009","unstructured":"Bonsma, P.: The complexity of the matching-cut problem for planar graphs and other graph classes. JGT 62(2), 109\u2013126 (2009)","journal-title":"JGT"},{"issue":"1\u20133","key":"5_CR2","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1016\/j.tcs.2008.07.002","volume":"407","author":"M Borowiecki","year":"2008","unstructured":"Borowiecki, M., Jesse-J\u00f3zefczyk, K.: Matching cutsets in graphs of diameter 2. Theoret. Comput. Sci. 407(1\u20133), 574\u2013582 (2008)","journal-title":"Theoret. Comput. Sci."},{"issue":"9","key":"5_CR3","doi-asserted-by":"publisher","first-page":"1993","DOI":"10.1016\/j.dam.2008.11.001","volume":"157","author":"B Bui-Xuan","year":"2009","unstructured":"Bui-Xuan, B., Habib, M., Limouzy, V., de Montgolfier, F.: Algorithmic aspects of a general modular decomposition theory. Discrete Appl. Math. 157(9), 1993\u20132009 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"5_CR4","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1016\/j.ejc.2011.09.032","volume":"33","author":"B Bui-Xuan","year":"2012","unstructured":"Bui-Xuan, B., 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":"5_CR5","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."},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/jgt.3190080106","volume":"8","author":"V Chv\u00e1tal","year":"1984","unstructured":"Chv\u00e1tal, V.: Recognizing decomposable graphs. JGT 8(1), 51\u201353 (1984)","journal-title":"JGT"},{"issue":"3","key":"5_CR7","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. Discrete Appl. Math. 3(3), 163\u2013174 (1981)","journal-title":"Discrete Appl. Math."},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-60084-1_58","volume-title":"Automata, Languages and Programming","author":"A Ehrenfeucht","year":"1995","unstructured":"Ehrenfeucht, A., Harju, T., Rozenberg, G.: Theory of 2-structures. In: F\u00fcl\u00f6p, Z., G\u00e9cseg, F. (eds.) ICALP 1995. LNCS, vol. 944, pp. 1\u201314. Springer, Heidelberg (1995). \nhttps:\/\/doi.org\/10.1007\/3-540-60084-1_58"},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0304-3975(90)90130-A","volume":"70","author":"A Ehrenfeucht","year":"1990","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Theory of 2-structures, part II: representation through labeled tree families. Theor. Comput. Sci. 70(3), 305\u2013342 (1990)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2005.09.029","volume":"349","author":"J Fiala","year":"2005","unstructured":"Fiala, J., Paulusma, D.: A complete complexity classification of the role assignment problem. Theor. Comput. Sci. 349(1), 67\u201381 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR11","volume-title":"Submodular Functions and Optimization","author":"S Fujishige","year":"1991","unstructured":"Fujishige, S.: Submodular Functions and Optimization. North-Holland, Amsterdam (1991)"},{"issue":"8","key":"5_CR12","doi-asserted-by":"publisher","first-page":"R57","DOI":"10.1186\/gb-2004-5-8-r57","volume":"5","author":"J Gagneur","year":"2004","unstructured":"Gagneur, J., Krause, R., Bouwmeester, T., Casari, G.: Modular decomposition of protein-protein interaction networks. Genome Biol. 5(8), R57 (2004)","journal-title":"Genome Biol."},{"key":"5_CR13","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 Mathematica Academiae Scientiarum Hungaricae 18, 25\u201366 (1967)","journal-title":"Acta Mathematica Academiae Scientiarum Hungaricae"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1111\/j.1749-6632.1970.tb56468.x","volume":"175","author":"R Graham","year":"1970","unstructured":"Graham, R.: On primitive graphs and optimal vertex assignments. Ann. N.Y. Acad. Sci. 175, 170\u2013186 (1970)","journal-title":"Ann. N.Y. Acad. Sci."},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-030-25005-8_21","volume-title":"Combinatorial Algorithms","author":"M Habib","year":"2019","unstructured":"Habib, M., de Montgolfier, F., Mouatadid, L., Zou, M.: A general algorithmic scheme for modular decompositions of hypergraphs and applications. In: Colbourn, C.J., Grossi, R., Pisanti, N. (eds.) IWOCA 2019. LNCS, vol. 11638, pp. 251\u2013264. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-25005-8_21"},{"issue":"1","key":"5_CR16","doi-asserted-by":"publisher","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(1), 41\u201359 (2010)","journal-title":"Comput. Sci. Rev."},{"issue":"2","key":"5_CR17","doi-asserted-by":"publisher","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 tool kit. Int. J. Found. Comput. Sci. 10(2), 147\u2013170 (1999)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"5_CR18","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/0095-8956(87)90031-1","volume":"43","author":"W Hsu","year":"1987","unstructured":"Hsu, W.: Decomposition of perfect graphs. JCTB 43(1), 70\u201394 (1987)","journal-title":"JCTB"},{"key":"5_CR19","unstructured":"James, L.O., Stanton, R.G., Cowan, D.D.: Graph decomposition for undirected graphs. In: Proceedings of the 3rd Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic Univ., Boca Raton, Flo., pp. 281\u2013290 (1972)"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/j.tcs.2015.10.016","volume":"609","author":"D Kratsch","year":"2016","unstructured":"Kratsch, D., Le, V.B.: Algorithms solving the matching cut problem. Theor. Comput. Sci. 609, 328\u2013335 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF02022041","volume":"6","author":"RH M\u00f6hring","year":"1985","unstructured":"M\u00f6hring, R.H.: Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and boolean functions. Ann. Oper. Res. 6, 195\u2013225 (1985)","journal-title":"Ann. Oper. Res."},{"key":"5_CR22","first-page":"257","volume":"19","author":"R M\u00f6hring","year":"1984","unstructured":"M\u00f6hring, R., Radermacher, F.: Substitution decomposition for discrete structures and connections with combinatorial optimization. Ann. Discret. Math. 19, 257\u2013356 (1984)","journal-title":"Ann. Discret. Math."},{"issue":"5","key":"5_CR23","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1002\/jgt.3190130502","volume":"13","author":"AM Moshi","year":"1989","unstructured":"Moshi, A.M.: Matching cutsets in graphs. JGT 13(5), 527\u2013536 (1989)","journal-title":"JGT"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.future.2017.04.005","volume":"74","author":"C Nabti","year":"2017","unstructured":"Nabti, C., Seba, H.: Querying massive graph data: a compress and search approach. Future Gener. Comput. Syst. 74, 63\u201375 (2017)","journal-title":"Future Gener. Comput. Syst."},{"issue":"2","key":"5_CR25","doi-asserted-by":"publisher","first-page":"481","DOI":"10.7155\/jgaa.00155","volume":"11","author":"C Papadopoulos","year":"2007","unstructured":"Papadopoulos, C., Voglis, C.: Drawing graphs using modular decomposition. J. Graph Algorithms Appl. 11(2), 481\u2013511 (2007)","journal-title":"J. Graph Algorithms Appl."},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/3-540-45477-2_26","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M Patrignani","year":"2001","unstructured":"Patrignani, M., Pizzonia, M.: The complexity of the matching-cut problem. In: Brandst\u00e4dt, A., Le, V.B. (eds.) WG 2001. LNCS, vol. 2204, pp. 284\u2013295. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-45477-2_26"},{"issue":"1\u20133","key":"5_CR27","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0012-365X(01)00173-X","volume":"247","author":"I Rusu","year":"2002","unstructured":"Rusu, I., Spinrad, J.P.: Forbidden subgraph decomposition. Discrete Math. 247(1\u20133), 159\u2013168 (2002)","journal-title":"Discrete Math."},{"key":"5_CR28","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0095-8956(74)90063-X","volume":"16","author":"D Seinsche","year":"1974","unstructured":"Seinsche, D.: On a property of the class of n-colorable graphs. JCTB 16, 191\u2013193 (1974)","journal-title":"JCTB"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Serafino, P.: Speeding up graph clustering via modular decomposition based compression. In: Proceedings of the 28th Annual ACM Symposium on Applied Computing, SAC 2013, Coimbra, Portugal, 18\u201322 March 2013, pp. 156\u2013163 (2013)","DOI":"10.1145\/2480362.2480394"},{"key":"5_CR30","doi-asserted-by":"publisher","first-page":"199","DOI":"10.4064\/aa-27-1-199-245","volume":"27","author":"E Szemer\u00e9di","year":"1975","unstructured":"Szemer\u00e9di, E.: On sets of integers containing no k elements in arithmetic progression. Acta Arithmetica 27, 199\u2013245 (1975)","journal-title":"Acta Arithmetica"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39219-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,25]],"date-time":"2020-01-25T00:01:28Z","timestamp":1579910488000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39219-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030392185","9783030392192"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39219-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"24 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hyderabad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iith.ac.in\/~caldam2020\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}