1 citations · 1 across the 14 of their papers we have counts for
Showing cs.SIShow all
3 papers · 1 filter
cs.SI2023
A Dual-mode Local Search Algorithm for Solving the Minimum Dominating Set Problem
Enqiang Zhu, Yu Zhang, Shengzhi Wang +2
Given a graph, the minimum dominating set (MinDS) problem is to identify a smallest set of vertices such that every vertex not in is adjacent to at least one vertex in .…
cs.SI2022
PHEE: A phased hybrid evaluation-enhanced approach for identifying influential users in social networks
Enqiang Zhu, Haosen Wang, Yu Zhang +2
For the purpose of maximizing the spread of influence caused by a certain small number k of nodes in a social network, we are asked to find a k-subset of nodes (i.e., a seed set) w…
cs.SI2018
On Spectral Graph Embedding: A Non-Backtracking Perspective and Graph Approximation
Fei Jiang, Lifang He, Yi Zheng +3
Graph embedding has been proven to be efficient and effective in facilitating graph analysis. In this paper, we present a novel spectral framework called NOn-Backtracking Embedding…