1056 search results - page 77 / 212 » Constraint-Based Graph Matching |
FQAS
2009
Springer
14 years 3 months ago
2009
Springer
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
JCT
2006
13 years 9 months ago
2006
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletio...
COMPGEOM
1993
ACM
14 years 1 months ago
1993
ACM
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for n points in the d-dimensional unit cube. For each of ...
ICPR
2008
IEEE
14 years 10 months ago
2008
IEEE
In the framework of the interactive search in image databases, we are interested in similarity measures able to learn during the search and usable in real-time. Images are represe...
PODS
1993
ACM
14 years 1 months ago
1993
ACM
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...