G-Thinker: A General Distributed Framework for Finding Qualified Subgraphs In a Big Graph With Load Balancing: Author: Da Yan. Guimu Guo. Jalal Khalil. Tamer Ozsu. Wei-Shinn Ku. John Lui. Year of ...

Distributed line graphs were introduced by Zhang and Liu as an overlay for Peer-to-Peer networks. Distributed line graphs have some useful properties as a network topology, such as out-regular and ...

In the distribution network graph model G (V, E) for line loss analysis, if there exists S i (V i, E i), where V i ∈V and E i ∈E, then the graph S i is called a subgraph of graph G. Based on the ...

In this paper we consider the problem of distributed load balancing over a directed graph that is not fully connected. We study the impact of network topology on the stability and balance of ...

The graph below shows the total number of publications each year in Distributed Algorithms for Graph Problems. References [1] A distributed algorithm for vertex coloring problems in wireless networks.

Distributed algorithms for graph problems represent a vibrant area of study that addresses the challenges of decentralised computation across interconnected networks.