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.
%0 Journal Article
%1 Yong2008Algorithm
%A Yong, Liu
%A Gencheng, Guo
%A Jingjing, Qi
%C Los Alamitos, CA, USA
%D 2008
%I IEEE Computer Society
%J Computer Science and Software Engineering, International Conference on
%K clustering entityguides graph
%P 85--89
%R http://dx.doi.org/10.1109/CSSE.2008.1015
%T An Algorithm of System Decomposition Based on Laplace Spectral Graph Partitioning Technology
%U http://dx.doi.org/10.1109/CSSE.2008.1015
%V 2
%X 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.
@article{Yong2008Algorithm,
abstract = {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.},
added-at = {2009-03-12T15:42:50.000+0100},
address = {Los Alamitos, CA, USA},
author = {Yong, Liu and Gencheng, Guo and Jingjing, Qi},
biburl = {https://www.bibsonomy.org/bibtex/2c524ae1f2f30f04591b26aeeb6c04162/lillejul},
citeulike-article-id = {4043287},
doi = {http://dx.doi.org/10.1109/CSSE.2008.1015},
interhash = {6942faab77d6a6d6eb3f291f4560c8bf},
intrahash = {c524ae1f2f30f04591b26aeeb6c04162},
journal = {Computer Science and Software Engineering, International Conference on},
keywords = {clustering entityguides graph},
pages = {85--89},
posted-at = {2009-02-13 12:14:47},
priority = {2},
publisher = {IEEE Computer Society},
timestamp = {2009-03-12T15:42:50.000+0100},
title = {An Algorithm of System Decomposition Based on Laplace Spectral Graph Partitioning Technology},
url = {http://dx.doi.org/10.1109/CSSE.2008.1015},
volume = 2,
year = 2008
}