Yaojun Chen

activity

20182021

most citedHow the Network Topology, Traffic Distribution, and Routing Scheme Impact on the Spectrum Usage in Elastic Optical Networks

2 citations · 2 across the 2 of their papers we have counts for

collaborators

5 papers

math.CO2021

Generalized Turán number for linear forests

Xiutao Zhu, Yaojun Chen

The generalized Turán number $e x (n, K_{s}, H)$ is defined to be the maximum number of copies of a complete graph $K_{s}$ in any $H$ -free graph on $n$ vertices. Let $F$ be a linear forest…

math.CO2019

Gallai-Ramsey number of even cycles with chords

Fangfang Zhang, Zi-Xia Song, Yaojun Chen

For a graph $H$ and an integer $k \geq 1$ , the $k$ -color Ramsey number $R_{k} (H)$ is the least integer $N$ such that every $k$ -coloring of the edges of the complete graph $K_{N}$ contains…

cs.NI2018★ 2 cited

How the Network Topology, Traffic Distribution, and Routing Scheme Impact on the Spectrum Usage in Elastic Optical Networks

Haitao Wu, Fen Zhou, Zuqing Zhu +1

Elastic Optical Network (EON) has been considered as a promising optical networking technology to architect the next-generation backbone networks. Routing and Spectrum Assignment (…

cs.NI2018

On Virtual Network Embedding: Paths and Cycles

Haitao Wu, Fen Zhou, Yaojun Chen +1

Network virtualization provides a promising solution to overcome the ossification of current networks, allowing multiple Virtual Network Requests (VNRs) embedded on a common infras…

math.CO2018

Gallai-Ramsey number of odd cycles with chords

Fangfang Zhang, Zi-Xia Song, Yaojun Chen

A Gallai coloring is a coloring of the edges of a complete graph without rainbow triangles, and a Gallai $k$ -coloring is a Gallai coloring that uses at most $k$ colors. For an inte…