Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning

5 January 2022

Papers citing "Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning"

10 / 10 papers shown

Title
BFS based distributed algorithm for parallel local directed sub-graph enumeration Itay Levinas Roy Scherz Y. Louzoun 13 1 0 06 Jan 2022
Topological based classification using graph convolutional networks R. Abel I. Benami Y. Louzoun GNN 29 5 0 26 Oct 2019
The Landscape of the Planted Clique Problem: Dense subgraphs and the Overlap Gap Property D. Gamarnik Ilias Zadik 29 39 0 15 Apr 2019
Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure Matthew Brennan Guy Bresler Wasim Huleihel 96 106 0 19 Jun 2018
Optimal link prediction with matrix logistic regression Nicolai Baldin Quentin Berthet 51 17 0 19 Mar 2018
Graph Attention Networks Petar Velickovic Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Lio Yoshua Bengio GNN 479 20,138 0 30 Oct 2017
Learning Combinatorial Optimization Algorithms over Graphs H. Dai Elias Boutros Khalil Yuyu Zhang B. Dilkina Le Song 108 1,467 0 05 Apr 2017
Semi-Supervised Classification with Graph Convolutional Networks Thomas Kipf Max Welling GNN SSL 620 29,051 0 09 Sep 2016
A Statistical Model for Motifs Detection H. Javadi Andrea Montanari 25 2 0 17 Nov 2015
Computational Lower Bounds for Community Detection on Random Graphs Bruce Hajek Yihong Wu Jiaming Xu 130 116 0 25 Jun 2014