Get access

Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries

Authors

  • Peter Damaschke

    Corresponding author
    1. Department of Computer Science and Engineering, Chalmers University, 41296 Göteborg, Sweden
    • Department of Computer Science and Engineering, Chalmers University, 41296 Göteborg, Sweden
    Search for more papers by this author

Abstract

Suppose that we have (i) a graph with an unknown edge set and (ii) access to an oracle that returns all neighbors of a probed vertex. We want to find the hubs, that is, vertices with degree above a given threshold. An almost obvious two-stage randomized strategy is to query randomly sampled vertices and then their neighbors. We prove that this strategy achieves, in certain classes of sparse graphs, an asymptotically optimal query number among all possible querying strategies, including adaptive strategies. A detail of importance for an optimal constant factor is the number of probes in the neighborhood of a hub candidate. We show that 2 is in general the best choice in the graphs of interest. In a similar way we analyze, in the same model, the problem of finding small, almost dominating sets. The problems and graph classes are motivated mainly by the elucidation of interaction networks in molecular biology. © 2010 Wiley Periodicals, Inc. NETWORKS, Vol. 57(4), 344-350 2011

Get access to the full text of this article

Ancillary