47 search results - page 1 / 10 » Inexact Graph Matching: A Case of Study |
FLAIRS
2006
13 years 5 months ago
2006
Inexact graph matching has become an important research area because it is used to find similarities among objects in several real domains such as chemical and biological compound...
CEC
2007
IEEE
13 years 10 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
PAMI
2006
13 years 4 months ago
2006
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
EVOW
2006
Springer
13 years 8 months ago
2006
Springer
Many applications involve matching two graphs in order to identify their common features and compute their similarity. In this paper, we address the problem of computing a graph si...
ICSM
2003
IEEE
13 years 9 months ago
2003
IEEE
This paper presents a graph matching model for the software architecture recovery problem. Because of their expressiveness, the graphs have been widely used for representing both ...