3 papers
cs.SI2020
Summarizing graphs using the configuration model
Houquan Zhou, Shenghua Liu, Kyuhan Lee +3
Given a large graph, how can we summarize it with fewer nodes and edges while maintaining its key properties, such as spectral property? Although graphs play more and more importan…
cs.DB2020
SSumM: Sparse Summarization of Massive Graphs
Kyuhan Lee, Hyeonsoo Jo, Jihoon Ko +2
Given a graph G and the desired size k in bits, how can we summarize G within k bits, while minimizing the information loss? Large-scale graphs have become omnipresent, posing cons…
cs.SI2020
MONSTOR: An Inductive Approach for Estimating and Maximizing Influence over Unseen Networks
Jihoon Ko, Kyuhan Lee, Kijung Shin +1
Influence maximization (IM) is one of the most important problems in social network analysis. Its objective is to find a given number of seed nodes that maximize the spread of info…