970 search results - page 61 / 194 » On encodings of spanning trees |
DEXAW
2008
IEEE
15 years 7 months ago
2008
IEEE
In an XML document a considerable fraction consists of markup, that is, begin and end-element tags describing the document’s tree structure. XML compression tools such as XMill ...
107
Voted
COMGEO
2010
ACM
15 years 21 days ago
2010
ACM
our tree is an abstraction of a scalar field that encodes the nesting relationships of isosurfaces. We show how to use the contour tree to represent individual contours of a scala...
94
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We show that for every n-point metric space M and positive integer k, there exists a spanning tree T with unweighted diameter O(k) and weight w(T) = O(k · n1/k ) · w(MST(M)), an...
87
Voted
ACL
2012
13 years 3 months ago
2012
We propose a new approach to characterizing the timeline of a text: temporal dependency structures, where all the events of a narrative are linked via partial ordering relations l...
104
Voted
ALGORITHMICA
2007
15 years 22 days 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...