Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Wasim, Omer"'
Over the years, there has been extensive work on fully dynamic algorithms for classic graph problems that admit greedy solutions. Examples include $(\Delta+1)$ vertex coloring, maximal independent set, and maximal matching. For all three problems, th
Externí odkaz:
http://arxiv.org/abs/2411.04418
Autor:
Rajaraman, Rajmohan, Wasim, Omer
In this paper, we revisit the online recoloring problem introduced recently by Azar et al. In online recoloring, there is a fixed set $V$ of $n$ vertices and an initial coloring $c_0: V\rightarrow [k]$ for some $k\in \mathbb{Z}^{>0}$. Under an online
Externí odkaz:
http://arxiv.org/abs/2408.05370
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 resources, so as to avoid polarization and ensure community-wide conve
Externí odkaz:
http://arxiv.org/abs/2311.02349
Autor:
Wasim, Omer
This thesis initiates the study of the MAX-CUT problem in fully dynamic graphs. Given a graph $G=(V,E)$, we present the first fully dynamic algorithms to maintain a $\frac{1}{2}$-approximate cut in sublinear update time under edge insertions and dele
Externí odkaz:
http://hdl.handle.net/1828/11764
Autor:
Rajaraman, Rajmohan, Wasim, Omer
We study the online balanced graph re-partitioning problem (OBGR) which was introduced by Avin, Bienkowski, Loukas, Pacut, and Schmid [Avin et al., 2020] and has recently received significant attention [Pacut et al., 2021; Henzinger et al., 2021; Hen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::976a5bfe5f93fa19b93abe4ae9e16aca
Autor:
Wasim, Omer, King, Valerie
This paper initiates the study of the MAX-CUT problem in fully dynamic graphs. Given a graph G = (V,E), we present deterministic fully dynamic distributed and sequential algorithms to maintain a cut on G which always contains at least |E|/2 edges in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2ea5698ac7837bea5eaa85321a559ec9