Weidong Chen

A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks

D. Du, Lidong Wu, Weidong Chen, 2021, Journal of Combinatorial Optimization.

Node-to-Set Disjoint Paths in Biswapped Networks

Weidong Chen, Shan Ling, Weidong Chen, 2014, Comput. J..

Even-Length Cycles Embedded in Biswapped Networks

Weidong Chen, Sha-Fen Ling, 2022 .

The Maximum Community Partition Problem in Networks

Weili Wu, Zheng Gao, Zaixin Lu, 2013, 2013 International Conference on Social Intelligence and Technology.

Dominating problems in swapped networks

Weili Wu, Zaixin Lu, Weidong Chen, 2014, Inf. Sci..

Nearly Optimal Node-to-Set Parallel Routing in OTIS Networks

Wenjun Xiao, Behrooz Parhami, Weidong Chen, 2012, J. Interconnect. Networks.

Swapped (OTIS) Networks Built of Connected Basis Networks Are Maximally Fault Tolerant

Wenjun Xiao, Behrooz Parhami, Weidong Chen, 2009, IEEE Transactions on Parallel and Distributed Systems.

An Efficient Construction of Node Disjoint Paths in OTIS Networks

Wenjun Xiao, Behrooz Parhami, Weidong Chen, 2007, APPT.

Lower bounds on several versions of signed domination number

Weidong Chen, Enmin Song, E. Song, 2008, Discret. Math..

Biswapped Networks and Their Topological Properties

Wenjun Xiao, Behrooz Parhami, Wenhong Wei, 2007, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007).

General Biswapped Networks and Their Topological Properties

Zhen Zhang, Wenjun Xiao, Wenhong Wei, 2007, APPT.

On Some Results of Regular Digraphs as Coset Graphs and Their Applications

Wenhong Wei, Mingxin He, Wenjun Xiao, 2007, 2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007).

Discovering communities by information diffusion

Weidong Chen, Weidong Chen, 2011, 2011 Eighth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD).