7 citations · 12 across the 5 of their papers we have counts for
5 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…
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…
Bounded Search Tree Algorithms for Parameterized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes
James Nastos, Yong Gao
Many fixed-parameter tractable algorithms using a bounded search tree have been repeatedly improved, often by describing a larger number of branching rules involving an increasingl…
A note on the hardness of graph diameter augmentation problems
James Nastos, Yong Gao
A graph has \emph{diameter} D if every pair of vertices are connected by a path of at most D edges. The Diameter-D Augmentation problem asks how to add the a number of edges to a g…