3 papers
cs.DS2025
Coloring Graphs with Few Colors in the Streaming Model
Sepehr Assadi, Janani Sundaresan, Helia Yazdanyar
We study graph coloring problems in the streaming model, where the goal is to process an -vertex graph whose edges arrive in a stream, using a limited space that is smaller than…
cs.DS2025
Better Bounds for Semi-Streaming Single-Source Shortest Paths
Sepehr Assadi, Gary Hoppenworth, Janani Sundaresan
In the semi-streaming model, an algorithm must process any -vertex graph by making one or few passes over a stream of its edges, use words of space…
cs.DS2025
Distributed Triangle Detection is Hard in Few Rounds
Sepehr Assadi, Janani Sundaresan
In the distributed triangle detection problem, we have an -vertex network with one player for each vertex of the graph who sees the edges incident on the vertex. The p…