DocumentCode
2348515
Title
Approximate Graph Matching in Software Engineering
Author
Kpodjedo, Ségla
Author_Institution
SOCCER Lab., Ecole Polytech. de Montreal, Montreal, QC, Canada
fYear
2009
fDate
13-16 Oct. 2009
Firstpage
295
Lastpage
298
Abstract
Graph representations are widely adopted in many different areas to modelize objects or problems. In software engineering, many produced artifacts can be thought of as graphs and generic graph algorithms may be useful in many different contexts. Our research project is aimed at addressing the generic approximate graph matching and apply developed algorithms to software engineering problems.
Keywords
graph theory; software engineering; approximate graph matching; graph representations; software engineering; Benchmark testing; Databases; Documentation; Labeling; Mathematical model; Production; Reverse engineering; Software algorithms; Software engineering; Software maintenance; Error-Tolerant Graph Matching (ETGM); Meta-heuristics; Software evolution;
fLanguage
English
Publisher
ieee
Conference_Titel
Reverse Engineering, 2009. WCRE '09. 16th Working Conference on
Conference_Location
Lille
ISSN
1095-1350
Print_ISBN
978-0-7695-3867-9
Type
conf
DOI
10.1109/WCRE.2009.49
Filename
5328739
Link To Document