128 search results - page 16 / 26 » Isomorphic Subgraphs |
PVLDB
2010
13 years 5 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
GBRPR
2009
Springer
14 years 2 months ago
2009
Springer
This paper presents an approach to matching parts of deformable shapes. Multiscale salient parts of the two shapes are first identified. Then, these parts are matched if their im...
FAW
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we consider the recognition problem on a class of perfectly orderable graphs, namely, the HHD-free graphs, i.e., graphs that do not contain any induced subgraph iso...
GBRPR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Graph matching is often used for image recognition. Different kinds of graph matchings have been proposed such as (sub)graph isomorphism or error-tolerant graph matching...
ENC
2006
IEEE
13 years 11 months ago
2006
IEEE
Dung's argumentation approach is a unifying approach which has played an influential role on argumentation research and Artificial Intelligence (AI). Based on a proper repres...