An Algorithm of System Decomposition Based on Laplace Spectral Graph Partitioning Technology
- Resource Type
- Conference
- Authors
- Yong, Liu; Gencheng, Guo; Jingjing, Qi
- Source
- 2008 International Conference on Computer Science and Software Engineering Computer Science and Software Engineering, 2008 International Conference on. 2:85-89 Dec, 2008
- Subject
- Computing and Processing
Partitioning algorithms
Clustering algorithms
Software systems
Software algorithms
Graph theory
Iterative algorithms
Algorithm design and analysis
Independent component analysis
Software engineering
Software quality
object-oriented system
algebraic graph
Laplace spectral graph
decomposition algorithm
- Language
In this paper we propose a Spectral-Graph-Partitioning-based algorithm to decompose an object-oriented system into components. We begin with a weighted class dependence graph, in which vertexes stand for the classes and edges stand for the weight of the relationship between classes. We employ a technology from algebraic graph theory known as Laplace spectral graph partitioning to divide the class graph into components. The decomposition algorithm can be performed automatically and achieve a good performance.