{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:43Z","timestamp":1759638883746,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030250041"},{"type":"electronic","value":"9783030250058"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-25005-8_21","type":"book-chapter","created":{"date-parts":[[2019,7,14]],"date-time":"2019-07-14T23:02:23Z","timestamp":1563145343000},"page":"251-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications"],"prefix":"10.1007","author":[{"given":"Michel","family":"Habib","sequence":"first","affiliation":[]},{"given":"Fabien","family":"de Montgolfier","sequence":"additional","affiliation":[]},{"given":"Lalla","family":"Mouatadid","sequence":"additional","affiliation":[]},{"given":"Mengchuan","family":"Zou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"key":"21_CR1","volume-title":"Graphes et hypergraphes","author":"C Berge","year":"1970","unstructured":"Berge, C.: Graphes et hypergraphes. Dunod, Paris (1970)"},{"issue":"3","key":"21_CR2","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1137\/060651331","volume":"22","author":"A Bergeron","year":"2008","unstructured":"Bergeron, A., Chauve, C., de Montgolfier, F., Raffinot, M.: Computing common intervals of K permutations, with applications to modular decomposition of graphs. SIAM J. Discrete Math. 22(3), 1022\u20131039 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1111\/j.1749-6632.1970.tb56452.x","volume":"175","author":"LJ Billera","year":"1970","unstructured":"Billera, L.J.: Clutter decomposition and monotonic boolean functions. Ann. N.-Y. Acad. Sci. 175, 41\u201348 (1970)","journal-title":"Ann. N.-Y. Acad. Sci."},{"issue":"3","key":"21_CR4","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/0095-8956(71)90033-5","volume":"11","author":"LJ Billera","year":"1971","unstructured":"Billera, L.J.: On the composition and decomposition of clutters. J. Combin. Theory, Ser. B 11(3), 234\u2013245 (1971)","journal-title":"J. Combin. Theory, Ser. B"},{"issue":"1\u20133","key":"21_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2003.12.010","volume":"149","author":"JC Bioch","year":"2005","unstructured":"Bioch, J.C.: The complexity of modular decomposition of boolean functions. Discrete Appl. Math. 149(1\u20133), 1\u201313 (2005)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jagm.1999.1016","volume":"32","author":"P Bonizzoni","year":"1999","unstructured":"Bonizzoni, P., Vedova, G.D.: An algorithm for the modular decomposition of hypergraphs. J. Algorithms 32(2), 65\u201386 (1999)","journal-title":"J. Algorithms"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.entcs.2016.03.005","volume":"322","author":"M Borassi","year":"2016","unstructured":"Borassi, M., Crescenzi, P., Habib, M.: Into the square: on the complexity of some quadratic-time solvable problems. Electr. Notes Theor. Comput. Sci. 322, 51\u201367 (2016)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"1","key":"21_CR8","first-page":"55","volume":"5","author":"C Capelle","year":"2002","unstructured":"Capelle, C., Habib, M., de Montgolfier, F.: Graph decompositions and factorizing permutations. Discrete Math. Theor. Comput. Sci. 5(1), 55\u201370 (2002)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"4","key":"21_CR9","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.ipl.2008.05.005","volume":"108","author":"P Charbit","year":"2008","unstructured":"Charbit, P., Habib, M., Limouzy, V., de Montgolfier, F., Raffinot, M., Rao, M.: A note on computing set overlap classes. Inf. Process. Lett. 108(4), 186\u2013191 (2008)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"21_CR10","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":"2","key":"21_CR11","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1006\/inco.2002.3130","volume":"178","author":"B Courcelle","year":"2002","unstructured":"Courcelle, B.: A monadic second-order definition of the structure of convex hypergraphs. Inf. Comput. 178(2), 391\u2013411 (2002)","journal-title":"Inf. Comput."},{"issue":"2","key":"21_CR12","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"},{"issue":"1\u20132","key":"21_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0304-3975(97)00241-7","volume":"234","author":"M Habib","year":"2000","unstructured":"Habib, M., McConnell, R.M., Paul, C., Viennot, L.: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theor. Comput. Sci. 234(1\u20132), 59\u201384 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"21_CR14","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."},{"key":"21_CR15","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, pp. 281\u2013290 (1972)"},{"key":"21_CR16","unstructured":"McConnell, R.M.: A certifying algorithm for the consecutive-ones property. In: SODA, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 768\u2013777 (2004)"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/11604686_37","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"RM McConnell","year":"2005","unstructured":"McConnell, R.M., de Montgolfier, F.: Algebraic operations on PQ trees and modular decomposition trees. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 421\u2013432. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11604686_37"},{"issue":"2","key":"21_CR18","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.dam.2004.02.017","volume":"145","author":"RM McConnell","year":"2005","unstructured":"McConnell, R.M., de Montgolfier, F.: Linear-time modular decomposition of directed graphs. Discrete Appl. Math. 145(2), 198\u2013209 (2005)","journal-title":"Discrete Appl. Math."},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0304-0208(08)72966-9","volume-title":"Algebraic and Combinatorial Methods in Operations Research, Proceedings of the Workshop on Algebraic Structures in Operations Research","author":"R.H. M\u00f6hring","year":"1984","unstructured":"M\u00f6hring, R., Radermacher, F.: Substitution decomposition for discrete structures and connections with combinatorial optimization. In: Proceedings of the Workshop on Algebraic Structures in Operations Research, pp. 257\u2013355 (1984)"},{"key":"21_CR20","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF02022041","volume":"4","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. 4, 195\u2013225 (1985)","journal-title":"Ann. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25005-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:14:49Z","timestamp":1710350089000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-25005-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030250041","9783030250058"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25005-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2019.di.unipi.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5-6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}