Learning Multi-Stage Sparsification for Maximum Clique Enumeration

12 September 2019

Papers citing "Learning Multi-Stage Sparsification for Maximum Clique Enumeration"

6 / 6 papers shown

Title
COMBHelper: A Neural Approach to Reduce Search Space for Graph Combinatorial Problems Hao Tian Sourav Medya Wei Ye 98 4 0 14 Dec 2023
Learning Heuristics for the Maximum Clique Enumeration Problem Using Low Dimensional Representations Ali Baran Tasdemir Tuna Karacan Emir Kaan Kirmaci Lale Özkahya 28 0 0 30 Oct 2022
wsGAT: Weighted and Signed Graph Attention Networks for Link Prediction Marco Grassia G. Mangioni 73 13 0 21 Sep 2021
Learning to Sparsify Travelling Salesman Problem Instances James Fitzpatrick Deepak Ajwani Paula Carroll 36 12 0 19 Apr 2021
Generalization of Machine Learning for Problem Reduction: A Case Study on Travelling Salesman Problems Yuan Sun Andreas T. Ernst Xiaodong Li J. Weiner 79 38 0 12 May 2020
Learning fine-grained search space pruning and heuristics for combinatorial optimization Juho Lauri Sourav Dutta Marco Grassia Deepak Ajwani 80 21 0 05 Jan 2020