2 papers
cs.DS2025
Fully Dynamic (Î+1) Coloring Against Adaptive Adversaries
Soheil Behnezhad, Rajmohan Rajaraman, Omer Wasim
Over the years, there has been extensive work on fully dynamic algorithms for classic graph problems that admit greedy solutions. Examples include vertex coloring, maximal…
cs.GT2024
Sample Complexity of Linear Regression Models for Opinion Formation in Networks
Haolin Liu, Rajmohan Rajaraman, Ravi Sundaram +3
Consider public health officials aiming to spread awareness about a new vaccine in a community interconnected by a social network. How can they distribute information with minimal…