1664 search results - page 80 / 333 » Distance labeling in graphs |
169
click to vote
PODC
2006
ACM
15 years 10 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
130
click to vote
PODC
2005
ACM
15 years 9 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
192
click to vote
ACSC
2010
IEEE
14 years 11 months ago
2010
IEEE
Terrains are an essential part of outdoor environments. Terrain models are important for computer games and applications in architecture, urban design and archaeology. A popular a...
148
click to vote
IBPRIA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper presents a new approach to the problem of simultaneous location and segmentation of object in images. The main emphasis is done on the information provided by ...
115
click to vote
IPL
2007
15 years 4 months ago
2007
Culberson and Rudnicki [1] gave an algorithm that reconstructs a degree d restricted tree from its distance matrix. According to their analysis, it runs in time O(dn logd n) for t...