829 search results - page 122 / 166 » Distance domination-critical graphs |
CCCG
2009
15 years 29 days ago
2009
The point placement problem is to determine the positions of a linear set of points, P = {p1, p2, p3, . . . , pn}, uniquely, up to translation and reflection, from the fewest poss...
130
click to vote
JCP
2008
14 years 11 months ago
2008
We perform the task of shape recognition using a skeleton based method. Skeleton of the shape is considered as a free tree and is represented by a connectivity graph. Geometric fea...
104
click to vote
ACL
2006
15 years 1 months ago
2006
Shortage of manually labeled data is an obstacle to supervised relation extraction methods. In this paper we investigate a graph based semi-supervised learning algorithm, a label ...
ALGORITHMICA
2008
14 years 12 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for...