2 papers
cs.DS2022
GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams
David Tench, Evan West, Victor Zhang +6
Finding the connected components of a graph is a fundamental problem with uses throughout computer science and engineering. The task of computing connected components becomes more…
math.CO2019
Burning Two Worlds: Algorithms for Burning Dense and Tree-like Graphs
Shahin Kamali, Avery Miller, Kenny Zhang
Graph burning is a simple model for the spread of social influence in networks. The objective is to measure how quickly a fire (e.g., a piece of fake news) can be spread in a netwo…