38 citations · 38 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021
Connected Components for Infinite Graph Streams: Theory and Practice
Jonathan W. Berry, Cynthia A Phillips, Alexandra M. Porter
Motivated by the properties of unending real-world cybersecurity streams, we present a new graph streaming model: XStream. We maintain a streaming graph and its connected component…
cs.DS2021
On Greedy Approaches to Hierarchical Aggregation
Alexandra Porter, Mary Wootters
We analyze greedy algorithms for the Hierarchical Aggregation (HAG) problem, a strategy introduced in [Jia et al., KDD 2020] for speeding up learning on Graph Neural Networks (GNNs…