57 citations · 104 across the 12 of their papers we have counts for
Showing 2020 · cs.DBShow all
2 papers · 2 filters
cs.DB2020★ 40 cited
Incremental Lossless Graph Summarization
Jihoon Ko, Yunbum Kook, Kijung Shin
Given a fully dynamic graph, represented as a stream of edge insertions and deletions, how can we obtain and incrementally update a lossless summary of its current snapshot? As lar…
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…