Distributed Algorithms for Connectivity and MST in Large Graphs with Efficient Local Computation.
Eric AjierenKhalid HouraniWilliam K. Moses Jr.Gopal PanduranganPublished in: ICDCN (2022)
Keyphrases
- computationally efficient
- efficient implementation
- computational complexity
- computational cost
- computationally expensive
- minimum spanning tree
- linear algebra
- data structure
- significant improvement
- lightweight
- computationally intensive
- distributed environment
- highly efficient
- combinatorial optimization
- pruning strategy
- graph theory
- connected components
- learning algorithm
- theoretical analysis
- multi agent