{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:33:50Z","timestamp":1758274430545},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540606185"},{"type":"electronic","value":"9783540484875"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60618-1_84","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T20:48:58Z","timestamp":1330289338000},"page":"303-317","source":"Crossref","is-referenced-by-count":1,"title":["Modular decomposition of hypergraphs"],"prefix":"10.1007","author":[{"given":"P.","family":"Bonizzoni","sequence":"first","affiliation":[]},{"given":"G.","family":"Vedova","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Alain Cournier and Michel Habib. A new linear algorithm for modular decomposition. In Sophie Tison, editor, Trees in algebra and programming, CAAP '94: 19th international colloquium, LNCS 787, pages 68\u201384, 1994.","DOI":"10.1007\/BFb0017474"},{"key":"24_CR2","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1006\/jagm.1994.1013","volume":"16","author":"A. Ehrenfeucht","year":"1994","unstructured":"A. Ehrenfeucht, H.N. Gabow, R.M. McConnell, and S.J. Sullivan. An O(n 2) divide and conquer algorithm for the prime tree decomposition of 2-structures. Journal of Algorithms, 16:283\u2013294, 1994.","journal-title":"Journal of Algorithms"},{"key":"24_CR3","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0304-3975(90)90130-A","volume":"70","author":"A. Ehrenfeucht","year":"1990","unstructured":"A. Ehrenfeucht and G. Rozenberg. Theory of 2-structures, part 2: representations through labeled tree families. Theoretical Computer Science, 70:305\u2013342, 1990.","journal-title":"Theoretical Computer Science"},{"key":"24_CR4","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0304-3975(94)90233-X","volume":"132","author":"A. Ehrenfeucht","year":"1994","unstructured":"Andrzej Ehrenfeucht and Ross M. McConnell. A k-structure generalization of the theory of 2-structures. Theoretical Computer Science, 132:209\u2013227, 1994.","journal-title":"Theoretical Computer Science"},{"key":"24_CR5","unstructured":"A. Engelfriet, T. Harjan, A. Proskurowsky, and G. Rozenberg. Survey on graphs as 2-structures and parallel complexity of decomposition. Technical Report TR9306, University of Leiden, Department of Computer Science, 1993."},{"key":"24_CR6","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. C. Golumbic","year":"1980","unstructured":"M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980."},{"key":"24_CR7","unstructured":"Ross M. McConnell and Jeremy P. Spinrad. Linear-time modular decomposition of undirected graphs and efficient transitive orientation of comparability graphs. In 5th ACM-SIAM Symposium on Discrete Algorithms, pages 536\u2013545, 1994."},{"key":"24_CR8","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-94-009-5315-4_2","volume-title":"Graphs and Orders","author":"R. H. M\u00f6hring","year":"1985","unstructured":"R.H. M\u00f6hring. Algorithmic aspects of comparability graphs and interval graphs. In I. Rival, editor, Graphs and Orders, pages 41\u2013101. D. Reidel, Boston, 1985."},{"key":"24_CR9","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF02022041","volume":"4","author":"R. H. M\u00f6hring","year":"1985\/6","unstructured":"R.H. M\u00f6hring. Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and boolean functions. Annals of Operations Research, 4:195\u2013225, 1985\/6.","journal-title":"Annals of Operations Research"},{"key":"24_CR10","first-page":"257","volume":"19","author":"R. H. M\u00f6hring","year":"1984","unstructured":"R.H. M\u00f6hring and F.J. Radermacher. Substitution decomposition for discrete structures and connections with combinatorial optimization. Annals of Discrete Mathematics, 19:257\u2013356, 1984.","journal-title":"Annals of Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60618-1_84.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:00:56Z","timestamp":1605646856000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60618-1_84"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540606185","9783540484875"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-60618-1_84","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}