1154 search results - page 64 / 231 » On the editing distance of graphs |
VLDB
2005
ACM
14 years 3 months ago
2005
ACM
In various applications such as data cleansing, being able to retrieve categorical or numerical attributes based on notions of approximate match (e.g., edit distance, numerical di...
WG
2010
Springer
13 years 8 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
ALGORITHMICA
2007
13 years 10 months ago
2007
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...
TCS
2010
13 years 8 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
SIBGRAPI
2007
IEEE
14 years 4 months ago
2007
IEEE
Dental biometrics is used in forensic dentistry to identify or verify persons based on their dental radiographs. This paper presents a method for human identification based on den...