Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Cai, Dongrun"'
As the most powerful tool in discrepancy theory, the partial coloring method has wide applications in many problems including the Beck-Fiala problem and Spencer's celebrated result. Currently, there are two major algorithmic methods for the partial c
Externí odkaz:
http://arxiv.org/abs/2408.13756
Effective resistances are ubiquitous in graph algorithms and network analysis. In this work, we study sublinear time algorithms to approximate the effective resistance of an adjacent pair $s$ and $t$. We consider the classical adjacency list model fo
Externí odkaz:
http://arxiv.org/abs/2307.01218