7 research outputs found
Cut Tree Construction from Massive Graphs
The construction of cut trees (also known as Gomory-Hu trees) for a given
graph enables the minimum-cut size of the original graph to be obtained for any
pair of vertices. Cut trees are a powerful back-end for graph management and
mining, as they support various procedures related to the minimum cut, maximum
flow, and connectivity. However, the crucial drawback with cut trees is the
computational cost of their construction. In theory, a cut tree is built by
applying a maximum flow algorithm for times, where is the number of
vertices. Therefore, naive implementations of this approach result in cubic
time complexity, which is obviously too slow for today's large-scale graphs. To
address this issue, in the present study, we propose a new cut-tree
construction algorithm tailored to real-world networks. Using a series of
experiments, we demonstrate that the proposed algorithm is several orders of
magnitude faster than previous algorithms and it can construct cut trees for
billion-scale graphs.Comment: Short version will appear at ICDM'1
Effective K-Vertex connected component detection in large-scale networks
National Research Foundation (NRF) Singapore under International Research Centres in Singapore Funding Initiativ
Friendsterにおけるユーザーネットワーク崩壊のメカニズム
学位の種別: 課程博士審査委員会委員 : (主査)東京大学教授 山口 和紀, 東京大学教授 山口 泰, 東京大学教授 植田 一博, 東京大学准教授 森畑 明昌, 東京大学准教授 田中 哲朗University of Tokyo(東京大学
LIPIcs, Volume 274, ESA 2023, Complete Volume
LIPIcs, Volume 274, ESA 2023, Complete Volum