2 citations · 2 across the 5 of their papers we have counts for
5 papers
Two classes of connectivity-related non-Hamiltonian 1-planar perfect graphs
Licheng Zhang, Shengxiang Lv, Yuanqiu Huang
The existence of Hamiltonian cycles in 1-planar graphs with higher connectivity has attracted considerable attention. Recently, the authors and Dong proved that 4-connected 1-plana…
The minimum size of 2-connected chordal bipartite graphs
Licheng Zhang, Yuanqiu Huang
A bipartite graph is chordal bipartite if every cycle of length at least six contains a chord. We determine the minimum size in 2-connected chordal bipartite graphs with given orde…
4-connected 1-planar chordal graphs are Hamiltonian-connected
Licheng Zhang, Yuanqiu Huang, Shengxiang Lv +1
Tutte proved that 4-connected planar graphs are Hamiltonian. It is unknown if there is an analogous result on 1-planar graphs. In this paper, we characterize 4-connected 1-planar c…
Random Entity Quantization for Parameter-Efficient Compositional Knowledge Graph Representation
Jiaang Li, Quan Wang, Yi Liu +2
Representation Learning on Knowledge Graphs (KGs) is essential for downstream tasks. The dominant approach, KG Embedding (KGE), represents entities with independent vectors and fac…
Video traffic identification with novel feature extraction and selection method
Licheng Zhang, Shuaili Liu, Qingsheng Yang +2
In recent years, the rapid rise of video applications has led to an explosion of Internet video traffic, thereby posing severe challenges to network management. Therefore, effectiv…