I have a problem on distributed graph, with the following model: 1. There is a Global Graph $G=(V,E)$ 2. There are $k$ computers. 3. Each computer $1 \leq i \leq k$ knows ALL the nodes of the graph, i.e. $V$, and subset of the edges, i.e. computer $i$ knows $V_i \subseteq V$. 4. Each computer observes different subset of edges, i.e., for all $i,j$ : $V_i \cap V_j = \emptyset$. I searched for papers which handle the same model, but I didn't find anything. Do you know if such model is being studied?
Does such model exists?
graph theory;graph algorithms;dc.distributed comp;dc.parallel comp;network modeling