1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.DS2024
Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy
Sepehr Assadi, Prantar Ghosh, Bruno Loff +2
The following question arises naturally in the study of graph streaming algorithms: "Is there any graph problem which is "not too hard", in that it can be solved efficiently with t…
cs.DS2022★ 1 cited
Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for -Coloring
Sepehr Assadi, Pankaj Kumar, Parth Mittal
Every graph with maximum degree can be colored with colors using a simple greedy algorithm. Remarkably, recent work has shown that one can find such a coloring even in…