Jou-Ming Chang

activity

20242026

collaborators

3 papers

math.CO2026

Paired 2-disjoint path covers of Bcube under the partitioned edge fault model

Wenjing Zhang, Qingqiong Cai, Jou-Ming Chang

BCube, as a popular server-centric data center network (DCN), offers significant advantages in low latency, load balancing, and high bandwidth. The many-to-many paired $m$ -disjoint…

math.CO2025

Neighbor Connectivity of Undirected Toroidal Meshes

Hui-Ming Huang, Ruichao Niu, Min Xu +1

In this paper, we examine the neighbor connectivity, denoted as $I^º_{N B}$ , of the undirected toroidal mesh $C (d_{1}, d_{2}, \dots, d_{n})$ . We demonstrate that $Îº_{NB}(C(d_1,d_2,\ldots,d_…

math.CO2024

Packing internally disjoint Steiner paths of data center networks

Wen-Han Zhu, Rong-Xia Hao, Jou-Ming Chang +1

Let $S \subseteq V (G)$ and $I ¨ _{G} (S)$ denote the maximum number $t$ of edge-disjoint paths $P_{1}, P_{2}, \dots, P_{t}$ in a graph $G$ such that $V (P_{i}) \cap V (P_{j}) = S$ for any $i,…