796 search results - page 146 / 160 » The Anonymous Subgraph Problem |
ISAAC
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
SPAA
2010
ACM
14 years 1 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
DCOSS
2008
Springer
13 years 10 months ago
2008
Springer
This paper studies the problem of associating deterministically a track revealed by a binary sensor network with the trajectory of a unique moving anonymous object, namely the Mult...
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
Abstract—Location privacy has been a serious concern for mobile users who use location-based services provided by the thirdparty provider via mobile networks. Recently, there hav...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...