Zobrazeno 1 - 10
of 89
pro vyhledávání: '"Tan, Zihan"'
Personalized Federated Graph Learning (pFGL) facilitates the decentralized training of Graph Neural Networks (GNNs) without compromising privacy while accommodating personalized requirements for non-IID participants. In cross-domain scenarios, struct
Externí odkaz:
http://arxiv.org/abs/2410.20105
Autor:
Chen, Yu, Tan, Zihan
We study the following distance realization problem. Given a quasi-metric $D$ on a set $T$ of terminals, does there exist a directed Okamura-Seymour graph that realizes $D$ as the (directed) shortest-path distance metric on $T$? We show that, if we a
Externí odkaz:
http://arxiv.org/abs/2410.19246
Autor:
Chen, Yu, Tan, Zihan
We study vertex sparsification for preserving cuts. Given a graph $G$ with a subset $|T|=k$ of its vertices called terminals, a \emph{quality-$q$ cut sparsifier} is a graph $G'$ that contains $T$, such that, for any partition $(T_1,T_2)$ of $T$ into
Externí odkaz:
http://arxiv.org/abs/2407.10852
Expander decompositions form the basis of one of the most flexible paradigms for close-to-linear-time graph algorithms. Length-constrained expander decompositions generalize this paradigm to better work for problems with lengths, distances and costs.
Externí odkaz:
http://arxiv.org/abs/2404.13446
Autor:
Chen, Yu, Tan, Zihan
We study the following characterization problem. Given a set $T$ of terminals and a $(2^{|T|}-2)$-dimensional vector $\pi$ whose coordinates are indexed by proper subsets of $T$, is there a graph $G$ that contains $T$, such that for all subsets $\emp
Externí odkaz:
http://arxiv.org/abs/2310.11367
Autor:
Chen, Yu, Tan, Zihan
In the Steiner point removal (SPR) problem, we are given a (weighted) graph $G$ and a subset $T$ of its vertices called terminals, and the goal is to compute a (weighted) graph $H$ on $T$ that is a minor of $G$, such that the distance between every p
Externí odkaz:
http://arxiv.org/abs/2310.07862
Autor:
Chen, Yu, Tan, Zihan
Given a large graph $G$ with a subset $|T|=k$ of its vertices called terminals, a quality-$q$ flow sparsifier is a small graph $G'$ that contains $T$ and preserves all multicommodity flows that can be routed between terminals in $T$, to within factor
Externí odkaz:
http://arxiv.org/abs/2310.07857
Competing short-range attractive (SA) and long range repulsive (LR) interactions have been invoked to describe colloid or protein solutions, as well as membrane proteins interactions mediated by lipid molecules. Using Langevin dynamics simulations, w
Externí odkaz:
http://arxiv.org/abs/2310.05197
A $t$-spanner of a graph is a subgraph that $t$-approximates pairwise distances. The greedy algorithm is one of the simplest and most well-studied algorithms for constructing a sparse spanner: it computes a $t$-spanner with $n^{1+O(1/t)}$ edges by re
Externí odkaz:
http://arxiv.org/abs/2304.08892
Autor:
Tan, Zihan, Zhang, Tianyi
Given an undirected unweighted graph $G = (V, E)$ on $n$ vertices and $m$ edges, a subgraph $H\subseteq G$ is a spanner of $G$ with stretch function $f: \mathbb{R}_+ \rightarrow \mathbb{R}_+$, if for every pair $s, t$ of vertices in $V$, $\text{dist}
Externí odkaz:
http://arxiv.org/abs/2303.12768