39 citations · 105 across the 10 of their papers we have counts for
10 papers
Learning Branching Heuristics from Graph Neural Networks
Congsong Zhang, Yong Gao, James Nastos
Backtracking has been widely used for solving problems in artificial intelligence (AI), including constraint satisfaction problems and combinatorial optimization problems. Good bra…
Exploring triad-rich substructures by graph-theoretic characterizations in complex networks
Songwei Jia, Lin Gao, Yong Gao +4
One of the most important problems in complex networks is how to detect metadata groups accurately. The main challenge lies in the fact that traditional structural communities do n…
Phase Transition of Tractability in Constraint Satisfaction and Bayesian Network Inference
Yong Gao
There has been great interest in identifying tractable subclasses of NP complete problems and designing efficient algorithms for these tractable classes. Constraint satisfaction an…
Consistency and Random Constraint Satisfaction Models
J. Culberson, Y. Gao
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show that…
An Analysis of Phase Transition in NK Landscapes
J. Culberson, Y. Gao
In this paper, we analyze the decision version of the NK landscape model from the perspective of threshold phenomena and phase transitions under two random distributions, the unifo…
Statistical Behavior of Embeddedness and Communities of Overlapping Cliques in Online Social Networks
Ajay Sridharan, Yong Gao, Kui Wu +1
Degree distribution of nodes, especially a power law degree distribution, has been regarded as one of the most significant structural characteristics of social and information netw…