1 citations · 1 across the 6 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2022
Computing (1+epsilon)-Approximate Degeneracy in Sublinear Time
Valerie King, Alex Thomo, Quinton Yong
The problem of finding the degeneracy of a graph is a subproblem of the k-core decomposition problem. In this paper, we present a (1 + epsilon)-approximate solution to the degenera…
cs.DS2020
Utility-Based Graph Summarization: New and Improved
Mahdi Hajiabadi, Jasbir Singh, Venkatesh Srinivasan +1
A fundamental challenge in graph mining is the ever-increasing size of datasets. Graph summarization aims to find a compact representation resulting in faster algorithms and reduce…
cs.DS2017★ 1 cited
Computation of K-Core Decomposition on Giraph
Alex Thomo, Fangming Liu
Graphs are an essential data structure that can represent the structure of social networks. Many online companies, in order to provide intelligent and personalized services for the…