JOURNAL ARTICLE

Approximate Graph Matching in Software Engineering

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:
Computer science Graph Theoretical computer science Matching (statistics) Software Software engineering Programming language Mathematics

Metrics

1
Cited By
0.00
FWCI (Field Weighted Citation Impact)
14
Refs
0.14
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Graph Theory and Algorithms
Physical Sciences →  Computer Science →  Computer Vision and Pattern Recognition
Software Testing and Debugging Techniques
Physical Sciences →  Computer Science →  Software
Advanced Database Systems and Queries
Physical Sciences →  Computer Science →  Computer Networks and Communications

Related Documents

JOURNAL ARTICLE

Algorithms for approximate graph matching

Jason T. L. WangKaizhong ZhangGung‐Wei Chirn

Journal:   Information Sciences Year: 1995 Vol: 82 (1-2)Pages: 45-74
BOOK-CHAPTER

Approximate Sub-graph Matching over Knowledge Graph

Jiyuan RenYangfu LiuYi ShenZhe WangZhen Luo

Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering Year: 2020 Pages: 198-208
JOURNAL ARTICLE

Simulation-based Approximate Graph Pattern Matching

Xiaohong Chen

Year: 2020 Pages: 2825-2827
BOOK-CHAPTER

Approximate Subgraph Matching Query over Large Graph

Yu ZhaoChunhong ZhangTingting SunYang JiZheng HuXiaofeng Qiu

Lecture notes in computer science Year: 2016 Pages: 247-256
© 2026 ScienceGate Book Chapters — All rights reserved.