Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
A LINEAR ALGORITHM TO DECOMPOSE INHERITANCE GRAPHS INTO MODULES
Autore:
HABIB M; HUCHARD M; SPINRAD J;
Indirizzi:
CNRS,LIRMM,161 RUE ADA F-34392 MONTPELLIER 5 FRANCE UNIV MONTPELLIER 2 F-34392 MONTPELLIER 5 FRANCE VANDERBILT UNIV,DEPT COMP SCI NASHVILLE TN 37235
Titolo Testata:
Algorithmica
fascicolo: 6, volume: 13, anno: 1995,
pagine: 573 - 591
SICI:
0178-4617(1995)13:6<573:ALATDI>2.0.ZU;2-6
Fonte:
ISI
Lingua:
ENG
Soggetto:
SERIES-PARALLEL DIGRAPHS;
Keywords:
INHERITANCE GRAPHS; LINEAR-TIME COMPLEXITY; MODULES; DOMINATORS; DECOMPOSITION; SUBSTITUTION; 2-CONNECTIVITY; LINEAR EXTENSION;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
CompuMath Citation Index
CompuMath Citation Index
Science Citation Index Expanded
Science Citation Index Expanded
Citazioni:
20
Recensione:
Indirizzi per estratti:
Citazione:
M. Habib et al., "A LINEAR ALGORITHM TO DECOMPOSE INHERITANCE GRAPHS INTO MODULES", Algorithmica, 13(6), 1995, pp. 573-591

Abstract

Inheritance graphs of object-oriented languages can be decomposed into independent subgraphs, or modules, which are inheritance graphs themselves. This paper is devoted to the study of efficient algorithms of decomposition into modules similar to substitution decomposition algorithms. For 2-connected inheritance graphs we search for maximal modules (under inclusion), whereas we show that the significant modules of non-2-connected graphs are the biconnected components. For the 2-connected case, a method based upon a property of greedy linear extensions is proposed. However, in both cases a linear-time complexity algorithm is provided to decompose into modules. Furthermore, the algorithm can be inserted into the inheritance mechanism (such as in CLOS [14]).

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 06/04/20 alle ore 01:58:48