1154 search results - page 25 / 231 » On the editing distance of graphs |
ICCV
2001
IEEE
16 years 1 months ago
2001
IEEE
159
click to vote
SIGMOD
2009
ACM
15 years 12 months ago
2009
ACM
Autocompletion is a useful feature when a user is doing a look up from a table of records. With every letter being typed, autocompletion displays strings that are present in the t...
108
click to vote
DEXAW
2006
IEEE
15 years 5 months ago
2006
IEEE
Detecting structural similarities between XML documents has been the subject of several recent work, and the proposed algorithms mostly use tree edit distance between the correspo...
124
click to vote
DIALM
2008
ACM
15 years 1 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
AAIM
2009
Springer
15 years 6 months ago
2009
Springer
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...