Parallel Heuristics for Balanced Graph Partitioning Based on Richness of Implicit Knowledge
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Access"
DOI: 10.1109/access.2019.2926753
Abstract: Balanced graph partitioning (BGP) has a wide range of applications that involve many large-scale distributed data processing problems. However, most of the existing approaches to parallel graph partitioning neglect the problem of the richness of… read more here.
Keywords: graph partitioning; balanced graph; richness implicit; graph ... See more keywords