41 search results - page 3 / 9 » A Note on Distance Approximating Trees in Graphs |
174
click to vote
ICDE
2006
IEEE
16 years 28 days ago
2006
IEEE
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
139
click to vote
ICALP
2001
Springer
15 years 4 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
IJCV
2007
14 years 11 months ago
2007
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...
118
click to vote
STOC
2006
ACM
15 years 12 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
SODA
2007
ACM
15 years 1 months ago
2007
ACM
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...