Composing subsystem structures using (k,2)-partite graphs
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
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
This publication has 11 references indexed in Scilit:
- Change management for very large software systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Rigi: a system for programming-in-the-largePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Serial and Parallel Algorithms for (k,2)-Partite GraphsJournal of Parallel and Distributed Computing, 1994
- Extracting and restructuring the design of large systemsIEEE Software, 1990
- Cross references are featuresPublished by Association for Computing Machinery (ACM) ,1989
- Edge concentration: a method for clustering directed graphsPublished by Association for Computing Machinery (ACM) ,1989
- A model of visibility controlIEEE Transactions on Software Engineering, 1988
- Error localization during software maintenance: generating hierarchical system descriptions from the source code alonePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- InfusePublished by Association for Computing Machinery (ACM) ,1987
- System partitioning and its measureJournal of Systems and Software, 1981