Zobrazeno 1 - 10
of 82
pro vyhledávání: '"Su, Hsin Hao"'
Graph Neural Networks (GNNs) are extensively employed in graph machine learning, with considerable research focusing on their expressiveness. Current studies often assess GNN expressiveness by comparing them to the Weisfeiler-Lehman (WL) tests or cla
Externí odkaz:
http://arxiv.org/abs/2410.01308
We consider the expander routing problem formulated by Ghaffari, Kuhn, and Su (PODC 2017), where the goal is to route all the tokens to their destinations given that each vertex is the source and the destination of at most $\deg(v)$ tokens. They deve
Externí odkaz:
http://arxiv.org/abs/2405.03908
In this paper, we study parallel algorithms for the correlation clustering problem, where every pair of two different entities is labeled with similar or dissimilar. The goal is to partition the entities into clusters to minimize the number of disagr
Externí odkaz:
http://arxiv.org/abs/2307.06723
Autor:
Ashvinkumar, Vikrant, Bernstein, Aaron, Cao, Nairen, Grunau, Christoph, Haeupler, Bernhard, Jiang, Yonggang, Nanongkai, Danupon, Su, Hsin Hao
This paper presents parallel and distributed algorithms for single-source shortest paths when edges can have negative weights (negative-weight SSSP). We show a framework that reduces negative-weight SSSP in either setting to $n^{o(1)}$ calls to any S
Externí odkaz:
http://arxiv.org/abs/2303.00811
Autor:
Huang, Shang-En, Su, Hsin-Hao
The maximum weighted matching (MWM) problem is one of the most well-studied combinatorial optimization problems in distributed graph algorithms. Despite a long development on the problem, and the recent progress of Fischer, Mitrovic, and Uitto [FMU22
Externí odkaz:
http://arxiv.org/abs/2212.14425
Autor:
Chang, Yi-Jun, Su, Hsin-Hao
Many combinatorial optimization problems can be approximated within $(1 \pm \epsilon)$ factors in $\text{poly}(\log n, 1/\epsilon)$ rounds in the LOCAL model via network decompositions [Ghaffari, Kuhn, and Maus, STOC 2018]. These approaches require s
Externí odkaz:
http://arxiv.org/abs/2205.08093
Miller and Reif's FOCS'85 classic and fundamental tree contraction algorithm is a broadly applicable technique for the parallel solution of a large number of tree problems. Additionally it is also used as an algorithmic design technique for a large n
Externí odkaz:
http://arxiv.org/abs/2111.01904
Publikováno v:
SIAM Journal on Discrete Mathematics 37(2), pp. 800-830 (2023)
Given a graph $G=(V,E)$ with arboricity $\alpha$, we study the problem of decomposing the edges of $G$ into $(1+\epsilon)\alpha$ disjoint forests in the distributed LOCAL model. Barenboim and Elkin [PODC `08] gave a LOCAL algorithm that computes a $(
Externí odkaz:
http://arxiv.org/abs/2009.10761
Autor:
Su, Hsin-Hao, Wein, Nicole
We study the problem of distributed task allocation in multi-agent systems. Suppose there is a collection of agents, a collection of tasks, and a demand vector, which specifies the number of agents required to perform each task. The goal of the agent
Externí odkaz:
http://arxiv.org/abs/2006.16898
Autor:
Su, Hsin-Hao, Vu, Hoa T.
We study distributed algorithms for some fundamental problems in data summarization. Given a communication graph $G$ of $n$ nodes each of which may hold a value initially, we focus on computing $\sum_{i=1}^N g(f_i)$, where $f_i$ is the number of occu
Externí odkaz:
http://arxiv.org/abs/1908.00236