Sciweavers

67
Voted
CIAC
2006
Springer

Distance Approximating Trees: Complexity and Algorithms

15 years 16 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
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2006
Where CIAC
Authors Feodor F. Dragan, Chenyu Yan
Comments (0)