How to Partition a Billion-Node Graph

How to Partition a Billion-Node Graph
How to Partition a Billion-Node Graph Lu Wang, Yanghua Xiao, Bin Shao, Haixun Wang MSR ICDE 2014 概要分散メモリシステムにグラフを載せることを考えるどうやって分割すればイイ？部分グラフのサイズ、辺カット、等が評価基準提案手法 multi-level propagation G頂点のグラフでも数時間で処理できたよ！背景 Kerninghan-Lin メモリベースグラフを二分していくクラスタ間の頂点を辺カットが小さくなるように交換 METIS Graph Coarseningをする先にある程...
論文一覧
...その他 How to Influence People with Partial Incentives Mining Social Networks Using Heat Diffusion Processes for Marketing ... Influence Maximization with Viral Product Design Profit Maximization over Social Networks On Budgeted Influence Maximization in Social Networks In Search of Influential Event Organizers in Online Social Networks Linear Computation for Independ...
気になった論文
...oring How Bad is Selfish Routing? Detecting a Network Failure Fully Dynamic Transitive Closure Breaking Through the O(n2) Barrier The Cover Time, the Blanket Time, and the Matthews Bound Randomized Rumor Spreading FOCS 2001 Online Facility Location Testing Subgraphs in Large Graphs Fast Monte-Carlo Algorithms for Approximate Matrix Multiplication Sp...
@wiki全体から「How to Partition a Billion-Node Graph」で調べる

todo314 @ ウィキ