Title :
Composing subsystem structures using (k,2)-partite graphs
Author :
Müller, Hausi A. ; Uhl, James S.
Author_Institution :
Dept. of Comput. Sci., Victoria Univ., BC, Canada
Abstract :
The authors describe a clustering method that uses equivalence relations for identifying subsystem structures. The relations are intended to embody the software engineering principles that concern module interactions, such as low coupling, high strength, small interfaces, and few interfaces. The resulting compositions are (k ,2)-partite graphs (a class of layered graphs) rather than strict tree hierarchies. The method is supported by an interactive graph editor
Keywords :
graph theory; software engineering; software maintenance; (k,2)-partite graphs; clustering method; equivalence relations; few interfaces; high strength; interactive graph editor; layered graphs; low coupling; module interactions; small interfaces; software engineering; subsystem structures; Buildings; Clustering algorithms; Clustering methods; Computer science; Data engineering; Optimizing compilers; Reverse engineering; Software design; Software maintenance; Tree graphs;
Conference_Titel :
Software Maintenance, 1990, Proceedings., Conference on
Conference_Location :
San Diego, CA
Print_ISBN :
0-8186-2091-9
DOI :
10.1109/ICSM.1990.131315
