3

Latent Geometry-Driven Network Automata for Complex Network Dismantling

Complex networks model the structure and function of critical technological, biological, and communication systems. Network dismantling---the targeted removal of nodes to fragment a network---is essential for analyzing and improving system …

Learning fine-grained search space pruning and heuristics for combinatorial optimization

Combinatorial optimization problems arise in a wide range of applications from diverse domains. Many of these problems are NP-hard and designing efficient heuristics for them requires considerable time and experimentation. On the other hand, the …

Learning Multi-Stage Sparsification for Maximum Clique Enumeration

We propose a multi-stage learning approach for pruning the search space of maximum clique enumeration, a fundamental computationally difficult problem arising in various network analysis tasks. In each stage, our approach learns the characteristics …