Sciweavers

67
Voted
CIAC
2006
Springer
110views Algorithms» more  CIAC 2006»
15 years 17 days ago
Distance Approximating Trees: Complexity and Algorithms
Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )
Feodor F. Dragan, Chenyu Yan