{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T19:40:27Z","timestamp":1736106027762,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637578"},{"type":"electronic","value":"9783540696438"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0024493","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:30:56Z","timestamp":1132385456000},"page":"118-131","source":"Crossref","is-referenced-by-count":2,"title":["Block decomposition of inheritance hierarchies"],"prefix":"10.1007","author":[{"given":"Christian","family":"Capelle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"12_CR1","volume-title":"D\u00e9compositions de Graphes et Permutations Factorisantes","author":"C. Capelle","year":"1997","unstructured":"Christian Capelle. D\u00e9compositions de Graphes et Permutations Factorisantes. PhD thesis, Universit\u00e9 Montpellier II, 161 rue Ada, 34392 Montpellier Cedex 5, France, January 1997."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Christian Capelle and Michel Habib. Graph decomposition and factorizing permutations. pages 132\u2013143, Juin 1997. fith Israel Symposium on the Theory of Computing and Systems (ISTCS'97).","DOI":"10.1109\/ISTCS.1997.595165"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. In Proceedings of 19th Annual Symposium on the Theory of Computation, pages 1\u20136, 1987.","DOI":"10.1145\/28395.28396"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"A. Cournier and M. Habib. A new linear algorithm for modular decomposition. In S. Tison, editor, Lectures notes in Computer Science, 787. Trees in Algebra and Programming-CAAP'94, pages 68\u201384. Springer-Verlag, April 1994. 19th International Colloquium, Edinburgh, U.K., April 1994. Procedings.","DOI":"10.1007\/BFb0017474"},{"key":"12_CR5","unstructured":"Elias Dahlhaus, Jens Gustedt, and Ross M. McConnell. Efficient and practical modular decomposition. In 8th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA), pages 26\u201335, January 1997."},{"key":"12_CR6","unstructured":"Celine De Hadjetlache and Carine Escale. Dessin de hierarchies d'h\u00e9ritage. Master's thesis, Universit\u00e9 Montpellier II, June 1996. M\u00e9moire de Stage de Recherche."},{"issue":"1","key":"12_CR7","first-page":"41","volume":"8","author":"R. Ducournau","year":"1989","unstructured":"Roland Ducournau and Michel Habib. La multiplicit\u00e9 de l'h\u00e9ritage dans les langages \u00e0 objects. Technique et Science Informatique, 8(1):41\u201362, 1989.","journal-title":"Technique et Science Informatique"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"M. Habib, M. Huthard, and J. Spinrad. A linear algorithm to decompose inheritance graphs into modules. Algorithmica, (13):573\u2013591, 1995.","DOI":"10.1007\/BF01189070"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Wen-Lian Hsu and Tze-Heng Ma. Substitution decomposition on chordal graphs and applications. In Proceedings of the 2nd ACM-SIGSAM Internationnal Symposium on Symbolic and Algebraic Computation, pages 52\u201360, 1991.","DOI":"10.1007\/3-540-54945-5_49"},{"key":"12_CR10","unstructured":"M. Huthard. Sur quelques questions algorithmiques de l'h\u00e9ritage multiple. PhD thesis, Universit\u00e9 Montpellier II, 1992."},{"key":"12_CR11","unstructured":"R. M. McConnell and J. Spinrad. Linear-time modular decomposition and efficient transitive orientation of undirected graphs, 1994. Proc. of the fifth Annual ACM-SIAM Symposium of Discrete Algorithms."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"R. H. M\u00f6hring and F. J. Radermacher. Substitution decomposition for discrete structures and connections with combinatorial optimization. Ann. Discrete math, (19):257\u2013356, 1984.","DOI":"10.1016\/S0304-0208(08)72966-9"},{"key":"12_CR13","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D.J. Rose","year":"1976","unstructured":"D.J. Rose, R.E. Tarjan, and G.S. Lueker. Algorithmic aspects of vertex elimination of graphs. SIAM journal of computing, 5:266\u2013283, 1976.","journal-title":"SIAM journal of computing"}],"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\/BFb0024493","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T18:59:24Z","timestamp":1736103564000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024493"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637578","9783540696438"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0024493","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}