OOPSLA '04

Program
Technical Program
  Invited Speakers
  Technical Papers
  Onward!
  Panels
  Practitioner Reports
  Tutorials
Workshops
DesignFest
Educators' Symposium
Demonstrations
Posters
Doctoral Symposium
Exhibits
Student Research Comp.
FlashBoF
 
Turing Lecture
 
Social Events
 
Week at a Glance
 
Final Program (1.5M .pdf)

Find in Program
 

Page
Printer-friendly

Basket
view, help

"Identification of Resusable Components Within an Object-Oriented Software System Using Algebraic Graph Theory"
Object-Oriented Programming, Systems, Languages and Applications
Home    Program    Housing & Transportation    Registration    Submissions    Wiki    Maps
 


 : Student Research Presentations at the Welcome Reception : Student Research Finalists Presentations : Student Research Award Presentation

Identification of Resusable Components Within an Object-Oriented Software System Using Algebraic Graph Theory

Spiros Xanthos, University of Macedonia

A novel method for identifying dense communities of classes (clusters) within an Object-Oriented system has been developed. Such communities might possibly imply relevance of functionality and thus be used as Reusable Components. To accomplish this we employ Algebraic Graph Theory (Spectral Graph Partitioning Techniques).