Sciweavers

776 search results - page 56 / 156
» Network Applications of Graph Bisimulation
Sort
View
MOBICOM
2006
ACM
14 years 4 months ago
Boundary recognition in sensor networks by topological methods
Wireless sensor networks are tightly associated with the underlying environment in which the sensors are deployed. The global topology of the network is of great importance to bot...
Yue Wang, Jie Gao, Joseph S. B. Mitchell
MST
2010
187views more  MST 2010»
13 years 4 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
KDD
2009
ACM
204views Data Mining» more  KDD 2009»
14 years 10 months ago
DOULION: counting triangles in massive graphs with a coin
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
Charalampos E. Tsourakakis, U. Kang, Gary L. Mille...
CORR
2010
Springer
119views Education» more  CORR 2010»
13 years 10 months ago
Graph-Constrained Group Testing
Non-adaptive group testing involves grouping arbitrary subsets of n items into different pools. Each pool is then tested and defective items are identified. A fundamental question...
Mahdi Cheraghchi, Amin Karbasi, Soheil Mohajer, Ve...
CIKM
2009
Springer
14 years 4 months ago
Privacy-enhanced public view for social graphs
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
Hyoungshick Kim, Joseph Bonneau