A constant-factor approximation for d-hop connected dominating sets in unit disk graph.
Xiaofeng GaoWeili WuXuefei ZhangXianyue LiPublished in: Int. J. Sens. Networks (2012)
Keyphrases
- connected components
- constant factor approximation
- graph representation
- approximation algorithms
- neighborhood graph
- graph theory
- random walk
- binary images
- graph structure
- graph theoretic
- graph mining
- connected graphs
- weighted graph
- bipartite graph
- directed graph
- structured data
- spanning tree
- directed acyclic graph
- strongly connected