1154 search results - page 54 / 231 » On the editing distance of graphs |
COCOC
1995
14 years 9 days ago
1995
We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree o...
ITS
2000
Springer
14 years 10 days ago
2000
Springer
We developed a distributed support model in an interface for distant learning. The support is integrated into the ExploraGraph navigator which makes it possible to navigate through...
SODA
2003
ACM
13 years 10 months ago
2003
ACM
The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g., computer vision, geographic informati...
JDA
2011
13 years 3 months ago
2011
It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as be...
SIAMCOMP
2000
13 years 8 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...