3 citations · 4 across the 5 of their papers we have counts for
5 papers
Hypergraph incidence coloring
Weichan Liu, Guiying Yan
An incidence of a hypergraph is a pair with , and . Two incidences and are adjacent if (i) , or (ii) $\…
Cut Bounds for Some Weighted Graphs
Chicheng Ma, Yucong Tang, Guanghui Wang +2
In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are us…
An Improved Error Term for Turn Number of Expanded Non-degenerate 2-graphs
Yucong Tang, Xin Xu, Guiying Yan
For a 2-graph , let be the -graph obtained from by enlarging each edge with a new set of vertices. We show that if , then $ {\rm ex}…
Algorithm on rainbow connection for maximal outerplanar graphs
Xingchao Deng, Hengzhe Li, Guiying Yan
In this paper, we consider rainbow connection number of maximal outerplanar graphs(MOPs) on algorithmic aspect. For the (MOP) , we give sufficient conditions to guarantee that $…
A Simple Probabilistic Algorithm for Detecting Community Structure in Social Networks
Wei Ren, Guiying Yan, Xiaoping Liao
In this paper, we propose a novel semi-parametric probabilistic model which considers interactions between different communities and can provide more information about the network…