Graph Summary: Towards Efficient Graph Algorithms in Distributed-Parallel Model
碩士 === 國立清華大學 === 資訊工程學系所 === 105 === Traditional graph algorithms assume that the input graphs are completely resided in a single machine. However, due to data management or privacy reasons, a graph could be partitioned and stored on different machines. For instance, when a graph is dynamic and ve...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2017
|
Online Access: | http://ndltd.ncl.edu.tw/handle/5fzyd3 |