What question did this study set out to answer?

The paper aims to develop a new algorithm that enhances graph partitioning for uncertain graphs.

A Vertex Partitioning Algorithm for Large‐Scale Uncertain Graphs

View Full Paper

Ask AI

Bookmark

Authors

Novel algorithm reduces cut-edge ratio and improves load balance in uncertain graph computing.

The paper aims to develop a new algorithm that enhances graph partitioning for uncertain graphs.
Formalizes the partitioning problem as an optimization task
Introduces probabilistic similarity to assess vertex relationships
Develops the PAUG algorithm with initial partitioning and refinement strategy
Achieves a 23.2% reduction in cut-edge ratio
Implements a 26.2% improvement in load balance
Outperforms existing state-of-the-art algorithms

Cui et al. (2026) studied this question.

View Full Paper

Ask AI

Bookmark