Efficient game theoretic approach to dynamic graph partitioning

Information Sciences(2022)

引用 1|浏览51
暂无评分
摘要
As a building block in many graph-based applications, graph partitioning aims to divide a graph into smaller parts of roughly equal size, and meanwhile, minimize the number of cutting edges. Existing solutions for graph partitioning are mainly designed for static graphs and are not appropriate for many dynamic graphs in real-world scenarios, including social networks, knowledge graphs, and web graphs. Although there is an incremental method, called IncKGGGP, proposed to efficiently deal with dynamic graphs, it can only be deployed on top of a specific batch partitioning algorithm, called KGGGP, which inherently impairs the final partitioning quality.
更多
查看译文
关键词
Distributed computing,Dynamic graph,Game theory,Graph partitioning
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要