4 papers
Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics
Jialiang Li, Aneta Neumann, Frank Neumann +2
Treewidth is a fundamental graph invariant that quantifies how tree-like a given graph is. It is extensively used with dynamic programming to design fixed-parameter tractable algor…
Maintenance of Structural Hole Spanners in Dynamic Networks
Diksha Goel, Hong Shen, Hui Tian +1
Structural Hole (SH) spanners are the set of users who bridge different groups of users and are vital in numerous applications. Despite their importance, existing work for identify…
Effective Graph-Neural-Network based Models for Discovering Structural Hole Spanners in Large-Scale and Diverse Networks
Diksha Goel, Hong Shen, Hui Tian +1
A Structural Hole Spanner (SHS) is a set of nodes in a network that act as a bridge among different otherwise disconnected communities. Numerous solutions have been proposed to dis…
Discovering Top-k Structural Hole Spanners in Dynamic Networks
Diksha Goel, Hong Shen, Hui Tian +1
Structural Hole (SH) theory states that the node which acts as a connecting link among otherwise disconnected communities gets positional advantages in the network. These nodes are…