Zobrazeno 1 - 10
of 667
pro vyhledávání: '"Liu, Chun‐Hung"'
This paper explores the structure of graphs defined by an excluded minor or an excluded odd minor through the lens of graph products and tree-decompositions. We prove that every graph excluding a fixed odd minor is contained in the strong product of
Externí odkaz:
http://arxiv.org/abs/2410.20333
In this paper, we study user association and wireless bandwidth allocation for a hierarchical federated learning system that consists of mobile users, edge servers, and a cloud server. To minimize the length of a global round in hierarchical federate
Externí odkaz:
http://arxiv.org/abs/2408.09076
Autor:
Liu, Chun-Hung, Wood, David R.
This paper studies the structure of graphs with given tree-width and excluding a fixed complete bipartite subgraph, which generalises the bounded degree setting. We give a new structural description of such graphs in terms of so-called quasi-tree-par
Externí odkaz:
http://arxiv.org/abs/2408.00983
Autor:
Liu, Chun-Hung, Yoo, Youngho
Motivated by Hadwiger's conjecture and related problems for list-coloring, we study graphs $H$ for which every graph with minimum degree at least $|V(H)|-1$ contains $H$ as a minor. We prove that a large class of apex-outerplanar graphs satisfies thi
Externí odkaz:
http://arxiv.org/abs/2403.11470
Autor:
Liu, Chun-Hung, Reed, Bruce
We introduce peaceful colourings, a variant of $h$-conflict free colourings. We call a colouring with no monochromatic edges $p$-peaceful if for each vertex $v$, there are at most $p$ neighbours of $v$ coloured with a colour appearing on another neig
Externí odkaz:
http://arxiv.org/abs/2402.09762
Autor:
Liu, Chun-Hung, Reed, Bruce
A proper conflict-free colouring of a graph is a colouring of the vertices such that any two adjacent vertices receive different colours, and for every non-isolated vertex $v$, some colour appears exactly once on the neighbourhood of $v$. Caro, Petru
Externí odkaz:
http://arxiv.org/abs/2401.02155
Autor:
Crouch, Joshua, Liu, Chun-Hung
Weak diameter coloring of graphs recently attracted attention partially due to its connection to asymptotic dimension of metric spaces. We consider weak diameter list-coloring of graphs in this paper. Dvo\v{r}\'{a}k and Norin proved that graphs with
Externí odkaz:
http://arxiv.org/abs/2310.17795
Autor:
Liu, Chun-Hung
Assouad-Nagata dimension addresses both large and small scale behaviors of metric spaces and is a refinement of Gromov's asymptotic dimension. A metric space $M$ is a minor-closed metric if there exists an (edge-)weighted graph $G$ satisfying a fixed
Externí odkaz:
http://arxiv.org/abs/2308.12273
Publikováno v:
IEEE Vehicular Technology Conference (VTC-Fall), 2022
Terahertz (THz) communication with ultra-wide available spectrum is a promising technique that can achieve the stringent requirement of high data rate in the next-generation wireless networks, yet its severe propagation attenuation significantly hind
Externí odkaz:
http://arxiv.org/abs/2304.13109
Autor:
Cranston, Daniel W., Liu, Chun-Hung
A proper coloring of a graph is \emph{conflict-free} if, for every non-isolated vertex, some color is used exactly once on its neighborhood. Caro, Petru\v{s}evski, and \v{S}krekovski proved that every graph $G$ has a proper conflict-free coloring wit
Externí odkaz:
http://arxiv.org/abs/2211.02818