Guo Gencheng

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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(More)
  • 1