A new customizable inexact subgraph matching algorithm for attributed graphs uses node/edge attributes and a flexible graph edit distance cost function, demonstrated on family trees and control-flow graphs.
Graph-based comparison of executable objects (english version)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A customizable inexact subgraph matching algorithm for attributed graphs
A new customizable inexact subgraph matching algorithm for attributed graphs uses node/edge attributes and a flexible graph edit distance cost function, demonstrated on family trees and control-flow graphs.