1154 search results - page 22 / 231 » On the editing distance of graphs |
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two new operations, called node fusion and edge fusion, besides the t...
194
click to vote
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries...
ESCAPE
2007
Springer
15 years 3 months ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
134
click to vote
CVPR
2004
IEEE
15 years 3 months ago
2004
IEEE
In this paper, we propose a generative model for representing complex motion, such as wavy river, dancing fire and dangling cloth. Our generative method consists of four component...
COCOA
2008
Springer
15 years 1 months ago
2008
Springer
The goal of the Cluster Editing problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem i...