829 search results - page 52 / 166 » Distance domination-critical graphs |
SPAA
2005
ACM
15 years 5 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
WDAG
2005
Springer
15 years 5 months ago
2005
Springer
We study greedy routing over n nodes placed in a ring, with the distance between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such ...
STOC
2009
ACM
16 years 14 days ago
2009
ACM
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
CVGIP
2004
14 years 11 months ago
2004
In this article a novel algorithm is presented for 2D shape interpolation using the intrinsic shape parameters of a piecewise linear curve. The skeletons of two given shapes are c...
ICPR
2004
IEEE
16 years 29 days ago
2004
IEEE
In this project we consider the problem of tracking a soccer player using a static camera. The main goal is to find the position of players in the field at each instance of time t...