ABSTRACT
In distributed networks, some groups of nodes may have more inter-connections, perhaps due to their larger bandwidth availability or communication requirements. In many scenarios, it may be useful for the nodes to know if they form part of a dense subgraph, e.g., such a dense subgraph could form a high bandwidth backbone for the network. In this work, we address the problem of self-awareness of nodes in a dynamic network with regards to graph density, i.e., we give distributed algorithms for maintaining dense subgraphs (subgraphs that the member nodes are aware of). The only knowledge that the nodes need is that of the dynamic diameter D, i.e., the maximum number of rounds it takes for a message to traverse the dynamic network. For our work, we consider a model where the number of nodes are fixed, but a powerful adversary can add or remove a limited number of edges from the network at each time step. The communication is by broadcast only and follows the CONGEST model in the sense that only messages of O(log n) size are permitted, where n is the number of nodes in the network.
Our algorithms are continuously executed on the network, and at any time (after some initialization) each node will be aware if it is part (or not) of a particular dense subgraph. We give algorithms that approximate both the densest subgraph, i.e., the subgraph of the highest density in the network, and the at-least-k-densest subgraph (for a given parameter k), i.e., the densest subgraph of size at least k. We give a (2 + ε)-approximation algorithm for the densest subgraph problem. The at-least-k-densest subgraph is known to be NP-hard for the general case in the centralized setting and the best known algorithm gives a 2-approximation. We present an algorithm that maintains a (3+ε)-approximation in our distributed, dynamic setting. Our algorithms run in O(Dlog1+ε n) time.
- Reid Andersen and Kumar Chellapilla. Finding dense subgraphs with size bounds. In WAW '09: Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph, pages 25--37, 2009. Google ScholarDigital Library
- Samir Khuller and Barna Saha. On finding dense subgraphs. In ICALP (1), pages 597--608, 2009. Google ScholarDigital Library
- Fabian Kuhn, Rotem Oshman, and Yoram Moses. Coordinated consensus in dynamic networks. In PODC, pages 1--10, 2011. Google ScholarDigital Library
- David Peleg. Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000. Google ScholarDigital Library
- Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, and Roger Wattenhofer. Distributed verification and hardness of distributed approximation. In STOC, pages 363--372, 2011. Google ScholarDigital Library
Index Terms
- Brief announcement: maintaining large dense subgraphs on dynamic networks
Recommendations
A Note on the Inducibility of $$4$$4-Vertex Graphs
There is much recent interest in understanding the density at which constant size graphs can appear in a very large graph. Specifically, the inducibility of a graph $$H$$H is its extremal density, as an induced subgraph of $$G$$G, where $$|G| \...
Smaller Universal Targets for Homomorphisms of Edge-Colored Graphs
Computing and CombinatoricsAbstractFor a graph G, the density of G, denoted D(G), is the maximum ratio of the number of edges to the number of vertices ranging over all subgraphs of G. For a class of graphs, the value is the supremum of densities of graphs in . A k-edge-colored ...
Smaller universal targets for homomorphisms of edge-colored graphs
AbstractFor a graph G, the density of G, denoted D(G), is the maximum ratio of the number of edges to the number of vertices ranging over all subgraphs of G. For a class of graphs, the value is the supremum of densities of graphs in . A k-edge-...
Comments