230 search results - page 1 / 46 » A Linear Time Algorithm for L(2, 1)-Labeling of Trees |
ESA
2009
Springer
13 years 9 months ago
2009
Springer
MFCS
2007
Springer
13 years 11 months ago
2007
Springer
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...
LATIN
1995
Springer
13 years 8 months ago
1995
Springer
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The appr...
SIAMDM
2002
13 years 4 months ago
2002
Let T be an edge-weighted tree. A p-core of T is a set of p mutually disjoint paths in T that minimizes the sum of the distances of all vertices in T from any of the p paths, where...
ECCV
2008
Springer
14 years 6 months ago
2008
Springer
We present a new metric between histograms such as SIFT descriptors and a linear time algorithm for its computation. It is common practice to use the L2 metric for comparing SIFT d...