Approximate Graph Matching in Software Engineering

被引：0
|
作者：
Kpodjedo, Segla [1 ]
机构：
[1] Ecole Polytech Montreal, DGIGL, SOCCER Lab, Montreal, PQ, Canada
来源：
16TH WORKING CONFERENCE ON REVERSE ENGINEERING (WCRE 2009) | 2009年
关键词：
Software evolution; Error-Tolerant Graph Matching (ETGM); Meta-heuristics; DESIGN;
D O I：
10.1109/WCRE.2009.49
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
Graph representations are widely adopted in many different areas to modelin 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.
引用
收藏
页码：295 / 298
页数：4
相关论文
共 50 条
  • [1] ALGORITHMS FOR APPROXIMATE GRAPH MATCHING
    WANG, JTL
    ZHANG, KZ
    CHIRN, GW
    INFORMATION SCIENCES, 1995, 82 (1-2) : 45 - 74
  • [2] Engineering algorithms for approximate weighted matching
    Maue, Jens
    Sanders, Peter
    EXPERIMENTAL ALGORITHMS, PROCEEDINGS, 2007, 4525 : 242 - +
  • [3] Correcting the Output of Approximate Graph Matching Algorithms
    Lubars, Joseph
    Srikant, R.
    IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2018), 2018, : 1754 - 1762
  • [4] TALE: A tool for approximate large graph matching
    Tian, Yuanyuan
    Patel, Jignesh M.
    2008 IEEE 24TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3, 2008, : 963 - +
  • [5] The general graph matching game: Approximate core
    Vazirani, Vijay V.
    GAMES AND ECONOMIC BEHAVIOR, 2022, 132 : 478 - 486
  • [6] Fast Approximate Quadratic Programming for Graph Matching
    Vogelstein, Joshua T.
    Conroy, John M.
    Lyzinski, Vince
    Podrazik, Louis J.
    Kratzer, Steven G.
    Harley, Eric T.
    Fishkind, Donnie E.
    Vogelstein, R. Jacob
    Priebe, Carey E.
    PLOS ONE, 2015, 10 (04):
  • [7] Fast and Scalable Approximate Spectral Matching for Higher Order Graph Matching
    Park, Soonyong
    Park, Sung-Kee
    Hebert, Martial
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2014, 36 (03) : 479 - 492
  • [8] Approximate graph edit distance computation by means of bipartite graph matching
    Riesen, Kaspar
    Bunke, Horst
    IMAGE AND VISION COMPUTING, 2009, 27 (07) : 950 - 959
  • [9] Understanding hand gestures using approximate graph matching
    Miners, BW
    Basir, OA
    Kamel, MS
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2005, 35 (02): : 239 - 248
  • [10] AN APPROACH FOR APPROXIMATE SUBGRAPH MATCHING IN DOMAIN KNOWLEDGE GRAPH
    Wang, Hairong
    Su, Meng
    Li, Weijun
    Han, Meng
    JOURNAL OF NONLINEAR AND CONVEX ANALYSIS, 2020, 21 (08) : 1665 - 1676
12345