no code implementations • 11 May 2023 • Ya-Chun Liang, Clifford Stein, Hao-Ting Wei
The modern network aims to prioritize critical traffic over non-critical traffic and effectively manage traffic flow.
no code implementations • 12 Mar 2021 • Kuan-Yun Lai, Ya-Chun Liang, Ho-Lin Chen, Kazuo Iwama, Chung-Shou Liao
In this paper, we remove all the holes of unknown CR's; namely we prove that the CR is $\frac{2k}{k + \lfloor k/3 \rfloor}$ for all $k\geq 2$.
Data Structures and Algorithms
no code implementations • 29 Jan 2021 • Ya-Chun Liang, Chung-Shou Liao, Xinping Yi
This is a sharp reduction of the general graph re-coloring, whose optimal number of updates scales as the size of the network, thanks to the delicate exploitation of the structural properties of chordal graph classes.
Information Theory Information Theory