{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T17:05:25Z","timestamp":1648573525506},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1007\/bf01189070","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T22:39:28Z","timestamp":1108679968000},"page":"573-591","source":"Crossref","is-referenced-by-count":10,"title":["A linear algorithm to decompose inheritance graphs into modules"],"prefix":"10.1007","volume":"13","author":[{"given":"M.","family":"Habib","sequence":"first","affiliation":[]},{"given":"M.","family":"Huchard","sequence":"additional","affiliation":[]},{"given":"J.","family":"Spinrad","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0201008","volume":"1","author":"A. V. Aho","year":"1972","unstructured":"A. V. Aho, M. R. Garey, J. D. Ullman, The transitive reduction of a directed graph,SIAM J. Comput.,1 (1972), 131?137.","journal-title":"SIAM J. Comput."},{"key":"CR2","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1975","unstructured":"A. V. Aho, J. E. Hopcroft, J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1975."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/59287.59293","volume":"11","author":"H. A\u00eft-Kaci","year":"1989","unstructured":"H. A\u00eft-Kaci, R. Boyer, P. Lincoln, R. Nasr, Efficient implementation of lattice operations,ACM Trans. Programming Languages and Systems,11 (1989), 115?146.","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/978-94-009-2639-4_6","volume-title":"Algorithms and Order","author":"V. Bouchitt\u00e9","year":"1989","unstructured":"V. Bouchitt\u00e9, M. Habib, The calculation of invariants for ordered sets, inAlgorithms and Order (I. Rival, ed.), Kluwer, Dordrecht, 1989, pp. 231?279."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1051\/ita\/1979130100031","volume":"13","author":"O. Cogis","year":"1979","unstructured":"O. Cogis, M. Habib, Nombre de sauts et graphes s\u00e9rie-parall\u00e8les,RAIRO Inform. Th\u00e9or. Inform.,13 (1979), 3?18.","journal-title":"RAIRO Inform. Th\u00e9or. Inform."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"G. Di Battista, R. Tamassia, L. G. Tollis, Area requirement and symmetry display in drawing graphs.Proc. ACM Symposium on Computational Geometry, 1989.","DOI":"10.1145\/73833.73839"},{"key":"CR7","volume-title":"Y3, version 3","author":"R. Ducournau","year":"1988","unstructured":"R. Ducournau,Y3, version 3, SEMA-GROUP, Paris, 1988."},{"key":"CR8","first-page":"41","volume":"8","author":"R. Ducournau","year":"1989","unstructured":"R. Ducournau, M. Habib, La multiplicit\u00e9 de l'h\u00e9ritage dans les langages \u00e0 objets,Tech. Sci. Inform.,8 (1989), 41?62.","journal-title":"Tech. Sci. Inform."},{"key":"CR9","unstructured":"M. Habib, M. Huchard, A linear algorithm to decompose inheritance graphs into modules. Rapport de recherche CRIM no. 81, 1990."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0166-218X(79)90043-X","volume":"1","author":"M. Habib","year":"1979","unstructured":"M. Habib, M. C. Maurer, On theX-join decomposition for undirected graphs,Discrete Appl. Math.,1 (1979), 201?207.","journal-title":"Discrete Appl. Math."},{"key":"CR11","unstructured":"M. Huchard, Sur quelques questions algorithmiques de l'h?itage multiple. Th\u00e8se de doctorat, Universit\u00e9 Montpellier II, 1992."},{"key":"CR12","unstructured":"M. Huchard, M. L. Mugnier, M. Habib, R. Ducournau, Towards a unique multiple inheritance linearisation,Proc. EurOOp'e 91, Bratislava, 1991."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF00563529","volume":"6","author":"H. A. Kierstead","year":"1990","unstructured":"H. A. Kierstead, W. T. Trotter, The number of depth-first searches of an ordered set,Order,6 (1990), 295?304.","journal-title":"Order"},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"L. G. de Michiel, R. P. Gabriel, The common lisp object system: an overview.Proc. ECOOP '87, 1987, pp. 201?202.","DOI":"10.1007\/3-540-47891-4_15"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/58562.59300","volume":"36","author":"J. H. Muller","year":"1989","unstructured":"J. H. Muller, J. Spinrad, Incremental modular decomposition,J. Assoc. Comput. Mach.,36 (1989), 1?19.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR16","unstructured":"O. Pretzel, Problem submitted at the Oberwolfach Conference on Combinatorics and Ordered Sets, 1985."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0166-218X(92)90180-I","volume":"39","author":"J. Spinrad","year":"1992","unstructured":"J. Spinrad, P4-Trees and the substitution decomposition,Discrete Appl. Math. 39 (1992), 263?291.","journal-title":"Discrete Appl. Math."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. E. Tarjan","year":"1972","unstructured":"R. E. Tarjan, Depth-first search and linear graph algorithms.SIAM J. Comput.,1 (1972), 146?160.","journal-title":"SIAM J. Comput."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"J. Valdes, R. E. Tarjan, E. L. Lawlers, The recognition of series parallel digraphs,SIAM J. Comput.,11 (1982), 298?314.","journal-title":"SIAM J. Comput."},{"key":"CR20","doi-asserted-by":"crossref","unstructured":"P. Wegner, Concepts and paradigms of object-oriented programming,OOPS Messenger,1(1) (1990).","DOI":"10.1145\/382192.383004"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01189070.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01189070\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01189070","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:40:25Z","timestamp":1586119225000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01189070"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":20,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["BF01189070"],"URL":"https:\/\/doi.org\/10.1007\/bf01189070","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}