activity
20072021
most citedIdentifying network communities with a high resolution

190 citations · 359 across the 9 of their papers we have counts for

collaborators

9 papers

cs.SI2021★ 53 cited

A Survey of Community Detection Approaches: From Statistical Modeling to Deep Learning

Di Jin, Zhizhi Yu, Pengfei Jiao +5

Community detection, a fundamental task for network analysis, aims to partition a network into multiple sub-structures to help reveal their latent functions. Community detection ha…

cs.DM2017★ 25 cited

An efficient algorithm for finding all possible input nodes for controlling complex networks

Xizhe Zhang, Jianfei Han, Weixiong Zhang

Understanding structural controllability of a complex network requires to identify a Minimum Input nodes Set (MIS) of the network. It has been suggested that finding an MIS is equi…

cs.AI2014★ 9 cited

SAS+ Planning as Satisfiability

Ruoyun Huang, Yixin Chen, Weixiong Zhang

Planning as satisfiability is a principal approach to planning with many eminent advantages. The existing planning as satisfiability techniques usually use encodings compiled from…

cs.AI2014★ 9 cited

An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem

Gerold Jäger, Weixiong Zhang

The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. It is among the first problems used for studying intrinsic properties, in…

cs.SI2013

Identification of hybrid node and link communities in complex networks

Dongxiao He, Di Jin, Weixiong Zhang

Identification of communities in complex networks has become an effective means to analysis of complex systems. It has broad applications in diverse areas such as social science, e…

cs.SI2013★ 17 cited

Discovering link communities in complex networks by exploiting link dynamics

Dongxiao He, Dayou Liu, Weixiongzhang +2

Discovery of communities in complex networks is a fundamental data analysis problem with applications in various domains. Most of the existing approaches have focused on discoverin…

cs.AI2013★ 1 cited

Flexible and Approximate Computation through State-Space Reduction

Weixiong Zhang

In the real world, insufficient information, limited computation resources, and complex problem structures often force an autonomous agent to make a decision in time less than that…

cs.AI2011★ 55 cited

Phase Transitions and Backbones of the Asymmetric Traveling Salesman Problem

W. Zhang

In recent years, there has been much interest in phase transitions of combinatorial problems. Phase transitions have been successfully used to analyze combinatorial optimization pr…

physics.soc-ph2007★ 190 cited

Identifying network communities with a high resolution

Jianhua Ruan, Weixiong Zhang

Community structure is an important property of complex networks. An automatic discovery of such structure is a fundamental task in many disciplines, including sociology, biology,…