1056 search results - page 6 / 212 » Constraint-Based Graph Matching |
PCI
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper, we address the problem of computing a maximum-size subgraph of a P4-sparse graph which admits a perfect matching; in the case where the graph has a perfect...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...
EMMCVPR
2001
Springer
14 years 6 days ago
2001
Springer
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Due to rapid growth of the Internet technology and new scientific/technological advances, the number of applications that model data as graphs increases, because graphs have high e...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
General graph matching methods often suffer from the lack of mathematical structure in the space of graphs. Using kernel functions to evaluate structural graph similarity allows u...