57 citations · 75 across the 4 of their papers we have counts for
5 papers
On Completely Edge-Independent Spanning Trees in Locally Twisted Cubes
Xiaorui Li, Baolei Cheng, Jianxi Fan +2
A network can contain numerous spanning trees. If two spanning trees do not share any common edges, and are said to be pairwisely edge-disjoint. For spanning…
Fairness-aware Competitive Bidding Influence Maximization in Social Networks
Congcong Zhang, Jingya Zhou, Jin Wang +2
Competitive Influence Maximization (CIM) has been studied for years due to its wide application in many domains. Most current studies primarily focus on the micro-level optimizatio…
Network Representation Learning: From Preprocessing, Feature Extraction to Node Embedding
Jingya Zhou, Ling Liu, Wenqi Wei +1
Network representation learning (NRL) advances the conventional graph mining of social networks, knowledge graphs, and complex biomedical and physics information networks. Over doz…
Embedding complete multi-partite graphs into Cartesian product of paths and cycles
R. Sundara Rajan, A. Arul Shantrinal, K. Jagadeesh Kumar +3
Graph embedding is a powerful method in parallel computing that maps a guest network into a host network . The performance of an embedding can be evaluated by certain parame…
Hamiltonian Properties of DCell Networks
Xi Wang, Alejandro Erickson, Jianxi Fan +1
DCell has been proposed for data centers as a server centric interconnection network structure. DCell can support millions of servers with high network capacity by only using commo…