메뉴 건너뛰기




Volumn 13, Issue 6, 1995, Pages 573-591

A linear algorithm to decompose inheritance graphs into modules

Author keywords

2 Connectivity; Decomposition; Dominators; Inheritance graphs; Linear extension; Linear time complexity; Modules; Substitution

Indexed keywords


EID: 27144479394     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/BF01189070     Document Type: Article
Times cited : (11)

References (20)
  • 6
    • 84936700793 scopus 로고    scopus 로고
    • G. Di Battista, R. Tamassia, L. G. Tollis, Area requirement and symmetry display in drawing graphs. Proc. ACM Symposium on Computational Geometry, 1989.
  • 9
    • 84936700795 scopus 로고    scopus 로고
    • M. Habib, M. Huchard, A linear algorithm to decompose inheritance graphs into modules. Rapport de recherche CRIM no. 81, 1990.
  • 11
    • 84936700796 scopus 로고    scopus 로고
    • M. Huchard, Sur quelques questions algorithmiques de l'hℰitage multiple. Thèse de doctorat, Université Montpellier II, 1992.
  • 12
    • 84936700797 scopus 로고    scopus 로고
    • M. Huchard, M. L. Mugnier, M. Habib, R. Ducournau, Towards a unique multiple inheritance linearisation, Proc. EurOOp'e 91, Bratislava, 1991.
  • 14
    • 84936700798 scopus 로고    scopus 로고
    • L. G. de Michiel, R. P. Gabriel, The common lisp object system: an overview. Proc. ECOOP '87, 1987, pp. 201–202.
  • 16
    • 84936700799 scopus 로고    scopus 로고
    • O. Pretzel, Problem submitted at the Oberwolfach Conference on Combinatorics and Ordered Sets, 1985.
  • 20
    • 84936700815 scopus 로고    scopus 로고
    • P. Wegner, Concepts and paradigms of object-oriented programming, OOPS Messenger, 1(1) (1990).


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.